diff options
| author | OR-FOSSEE | 2015-10-20 14:33:10 +0530 |
|---|---|---|
| committer | OR-FOSSEE | 2015-10-20 14:33:10 +0530 |
| commit | c2679735a3443017e003ca095d0476bae2dd8e40 (patch) | |
| tree | 959d03dbbc9eab92871e88c795463ea35d05f47e | |
| parent | a108ebaa0c1f6c593221693e63834448be86c93b (diff) | |
| download | FOSSEE-Optimization-toolbox-c2679735a3443017e003ca095d0476bae2dd8e40.tar.gz FOSSEE-Optimization-toolbox-c2679735a3443017e003ca095d0476bae2dd8e40.tar.bz2 FOSSEE-Optimization-toolbox-c2679735a3443017e003ca095d0476bae2dd8e40.zip | |
Update qpipopt.sci
| -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 0d1b6b6..8c0d5c9 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 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. |