From e34332a406e4f3fba9b99c6f9ec5138edfcc6aa2 Mon Sep 17 00:00:00 2001 From: Harpreet Date: Wed, 23 Sep 2015 18:22:28 +0530 Subject: qpipopt added --- help/en_US/scilab_en_US_help/symphony_mat.html | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) (limited to 'help/en_US/scilab_en_US_help/symphony_mat.html') diff --git a/help/en_US/scilab_en_US_help/symphony_mat.html b/help/en_US/scilab_en_US_help/symphony_mat.html index d87fb63..cc337f4 100644 --- a/help/en_US/scilab_en_US_help/symphony_mat.html +++ b/help/en_US/scilab_en_US_help/symphony_mat.html @@ -41,7 +41,7 @@ xopt = symphony_mat(f,intcon,A,b,Aeq,beq) xopt = symphony_mat(f,intcon,A,b,Aeq,beq,lb,ub) xopt = symphony_mat(f,intcon,A,b,Aeq,beq,lb,ub,options) -[xopt,fopt,iter] = symphony_mat( ... ) +[xopt,fopt,status,output] = symphony_mat( ... )

Parameters

f : @@ -66,13 +66,14 @@

a 1xn matrix of doubles, the computed solution of the optimization problem

fopt :

a 1x1 matrix of doubles, the function value at x

-
iter : -

a 1x1 matrix of doubles, contains the number od iterations done by symphony

+
output : +

The output data structure contains detailed informations about the optimization process.

Description

Search the minimum or maximum of a constrained mixed integer linear programming optimization problem specified by : find the minimum or maximum of f(x) such that

-

+

+

We are calling SYMPHONY written in C by gateway files for the actual computation. SYMPHONY was originally written by ​Ted Ralphs, ​Menal Guzelsoy and ​Ashutosh Mahajan.

Examples

-- cgit