diff options
Diffstat (limited to 'help/en_US/linprog.xml')
| -rwxr-xr-x | help/en_US/linprog.xml | 23 |
1 files changed, 15 insertions, 8 deletions
diff --git a/help/en_US/linprog.xml b/help/en_US/linprog.xml index 1aa6e7c..47dd715 100755 --- a/help/en_US/linprog.xml +++ b/help/en_US/linprog.xml @@ -28,7 +28,8 @@ xopt = linprog(c,A,b,Aeq,beq) xopt = linprog(c,A,b,Aeq,beq,lb,ub) xopt = linprog(c,A,b,Aeq,beq,lb,ub,param) - [xopt, fopt, exitflag, output, lambda] = linprog(file) + xopt = linprog(file) + xopt = linprog(file,param) [xopt,fopt,exitflag,output,lambda] = linprog( ... ) </synopsis> @@ -84,10 +85,21 @@ Search the minimum of a constrained linear programming problem specified by : & & lb \leq x \leq ub \\ \end{eqnarray} </latex> + </para> + <para> The routine calls Clp for solving the linear programming problem, Clp is a library written in C++. </para> <para> -The exitflag allows to know the status of the optimization which is given back by Ipopt. +The options allows the user to set various parameters of the Optimization problem. +It should be defined as type "list" and contains the following fields. In the current version it only contains maxiter. +<itemizedlist> +<listitem>Syntax : options= list("MaxIter", [---]);</listitem> +<listitem>MaxIter : a Scalar, containing the Maximum Number of Iteration that the solver should take.</listitem> +<listitem>Default Values : options = list("MaxIter", [3000]);</listitem> +</itemizedlist> + </para> + <para> +The exitflag allows to know the status of the optimization which is given back by CLP. <itemizedlist> <listitem>exitflag=0 : Optimal Solution Found </listitem> <listitem>exitflag=1 : Primal Infeasible </listitem> @@ -99,9 +111,6 @@ The exitflag allows to know the status of the optimization which is given back b </itemizedlist> </para> <para> -For more details on exitflag see the ipopt documentation, go to http://www.coin-or.org/Ipopt/documentation/ - </para> - <para> The output data structure contains detailed informations about the optimization process. It has type "struct" and contains the following fields. <itemizedlist> @@ -114,8 +123,6 @@ The lambda data structure contains the Lagrange multipliers at the end of optimization. In the current version the values are returned only when the the solution is optimal. It has type "struct" and contains the following fields. <itemizedlist> -<listitem>lambda.lower: The Lagrange multipliers for the lower bound constraints.</listitem> -<listitem>lambda.upper: The Lagrange multipliers for the upper bound constraints.</listitem> <listitem>lambda.eqlin: The Lagrange multipliers for the linear equality constraints.</listitem> <listitem>lambda.ineqlin: The Lagrange multipliers for the linear inequality constraints.</listitem> </itemizedlist> @@ -209,7 +216,7 @@ ub=[%inf,%inf,%inf] <programlisting role="example"><![CDATA[ filepath = get_absolute_file_path('linprog.dem.sce'); filepath = filepath + "exmip1.mps" -[xopt,fopt,exitflag,output,lambda] =linprog(filepath); +[xopt,fopt,exitflag,output,lambda] =linprog(filepath) ]]></programlisting> </refsection> |