diff options
| author | Harpreet | 2015-10-20 14:30:08 +0530 |
|---|---|---|
| committer | Harpreet | 2015-10-20 14:30:08 +0530 |
| commit | 4b0ab259b440fa1bb57494dcbdffb865e293b768 (patch) | |
| tree | aeec28997c243efe4206128bcae9c9d3393b896b | |
| parent | e045ecbdc1151fc0dc50032c7f7874894bc32f51 (diff) | |
| download | FOSSEE-Optimization-toolbox-4b0ab259b440fa1bb57494dcbdffb865e293b768.tar.gz FOSSEE-Optimization-toolbox-4b0ab259b440fa1bb57494dcbdffb865e293b768.tar.bz2 FOSSEE-Optimization-toolbox-4b0ab259b440fa1bb57494dcbdffb865e293b768.zip | |
qpipopt_mat added
| -rw-r--r-- | macros/qpipopt.sci | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/macros/qpipopt.sci b/macros/qpipopt.sci index 4f8c535..8dfc6c3 100644 --- a/macros/qpipopt.sci +++ b/macros/qpipopt.sci @@ -21,9 +21,9 @@ function [xopt,fopt,exitflag,output,lambda] = qpipopt (varargin) // nbVar : a 1 x 1 matrix of doubles, number of variables // nbCon : a 1 x 1 matrix of doubles, number of constraints // Q : a n x n symmetric matrix of doubles, where n is number of variables, represents coefficients of quadratic in the quadratic problem. - // p : a 1 x n matrix of doubles, where n is number of variables, represents coefficients of linear in the quadratic problem - // LB : a 1 x n matrix of doubles, where n is number of variables, contains lower bounds of the variables. - // UB : a 1 x n matrix of doubles, where n is number of variables, contains upper bounds of the variables. + // p : a n x 1 matrix of doubles, where n is number of variables, represents coefficients of linear in the quadratic problem + // LB : a n x 1 matrix of doubles, where n is number of variables, contains lower bounds of the variables. + // UB : a n x 1 matrix of doubles, where n is number of variables, contains upper bounds of the variables. // conMatrix : a m x n matrix of doubles, where n is number of variables and m is number of constraints, contains matrix representing the constraint matrix // conLB : a m x 1 matrix of doubles, where m is number of constraints, contains lower bounds of the constraints. // conUB : a m x 1 matrix of doubles, where m is number of constraints, contains upper bounds of the constraints. |