From 95d920496cc4b3263c3ea1bc698e6fd5745917bd Mon Sep 17 00:00:00 2001 From: Harpreet Date: Tue, 17 Nov 2015 22:28:26 +0530 Subject: error management updated --- help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS | Bin 7157 -> 7152 bytes .../scilab_en_US_help/JavaHelpSearch/DOCS.TAB | 4 +-- .../en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS | Bin 258 -> 260 bytes .../scilab_en_US_help/JavaHelpSearch/POSITIONS | Bin 35046 -> 34771 bytes help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP | Bin 16384 -> 16384 bytes .../scilab_en_US_help/_LaTeX_symphonymat.xml_1.png | Bin 2934 -> 2547 bytes help/en_US/scilab_en_US_help/qpipopt.html | 24 ++++++------- help/en_US/scilab_en_US_help/qpipoptmat.html | 22 ++++++------ help/en_US/scilab_en_US_help/symphony.html | 40 ++++++++++----------- help/en_US/scilab_en_US_help/symphonymat.html | 8 ++--- 10 files changed, 49 insertions(+), 49 deletions(-) (limited to 'help/en_US/scilab_en_US_help') diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS index bf90ce2..02038f6 100644 Binary files a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS and b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS differ diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB index 1b174ab..23181b6 100644 --- a/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB +++ b/help/en_US/scilab_en_US_help/JavaHelpSearch/DOCS.TAB @@ -1,2 +1,2 @@ -eџџџџџџџџџџџџџї_џџџџџџџџџџџџџџџџџџџџџї_џџџџџџџџџџџџџџџџџџџџџџџџџџџџџџy§езџ§зџї_џ§зџuџџџџџџ§Я'\вџџџџџџџџџџџџџџџџѓ ї_§ЕџџџѓЩџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџЧџ4Ÿџџ§зџї_ќhT‘‘_e4Нs ќвџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџє _ -C`Є7FF$рЈє  œ6Ј(qˆ\tX6‘ТБPа$ t и ”`6 Š |*Vƒ@ЊXRЎ†Хф ‚AёX{0lHтЃJ (3\/ тХЦPАГ…$2 …YGеЫ†G…r†Ž Ч$Vƒ(&QoЁŸцZ№Р(0–OўКЉзuџ8Љ?Ћї_Ь)[Й’j_иТzяџЬ&eџкЉY;7|T0Т !аФ,ЁBŒ(ђ*2 Uё‘rŒ‡&(OЏЫѓ 0П0ГаМйБFŠ6/ЭtŸаГебђЯвлЦ]~жm*œ`QгІBѓjЇђЬ/џѓ џџЭ/Ь/9Y.,пdъЊПџeџџЫџ7џџџ§ЕeџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџйrЬДЋЊЊdВЬЋtЂџ0Г 0МЫЈПќТЬ,Тџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџи \ No newline at end of file +eџџџџџџџџџџџџџї_џџџџџџџџџџџџџџџџџџџџџї_џџџџџџџџџџџџџџџџџџџџџџџџџџџџџџy§езџ§зџї_џ§зџuџџџџџџ§Я'\вџџџџџџџџџџџџџџџќТ}зџmџџќђџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџќpGџќвџџџ§зџї_ќhT‘‘_e4Нs ќвџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџє _ +C`Є7FF$рЌє  œ6Ј(qˆ\tX6‘ТБPа$ t и ”`6 Š |*Vƒ@ЊXRЎ†Хф ‚AёX{0lHтЃJ (3\/ тХЦPАГ…O$2 …YGеЫ†G…r† Ч$Vƒ(&QoЁŸцZ№Р(0–OўКЉзuџ<Љ?Ћї_Ь)[Й’j_иТzяџЬ&eџкЉY;7|T0Т !аФ,ЁBŒ(ђ*2 Uё‘rŒ‡&(OЏЫѓ 0П0ГаМйБFŠ6/ЭtŸаГеаГєЗGWG_ŸЦѕ›JЇtщМкЉќГ џќТџџѓKѓ ЮV,пdъЊПџeџџЫџ7џџџ§ЙYџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџі\Геб’юЊЉ’ЊЫ2­в‹ќТЬ,Тѓ.Ђџѓ 0Г џџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџ` \ No newline at end of file diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS b/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS index ac2dfed..d20c98d 100644 Binary files a/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS and b/help/en_US/scilab_en_US_help/JavaHelpSearch/OFFSETS differ diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS b/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS index 8be86f0..e2773de 100644 Binary files a/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS and b/help/en_US/scilab_en_US_help/JavaHelpSearch/POSITIONS differ diff --git a/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP b/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP index 28f8966..7e8baef 100644 Binary files a/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP and b/help/en_US/scilab_en_US_help/JavaHelpSearch/TMAP differ diff --git a/help/en_US/scilab_en_US_help/_LaTeX_symphonymat.xml_1.png b/help/en_US/scilab_en_US_help/_LaTeX_symphonymat.xml_1.png index 07dafd6..2e81ca1 100644 Binary files a/help/en_US/scilab_en_US_help/_LaTeX_symphonymat.xml_1.png and b/help/en_US/scilab_en_US_help/_LaTeX_symphonymat.xml_1.png differ diff --git a/help/en_US/scilab_en_US_help/qpipopt.html b/help/en_US/scilab_en_US_help/qpipopt.html index 6659f44..b1c18ac 100644 --- a/help/en_US/scilab_en_US_help/qpipopt.html +++ b/help/en_US/scilab_en_US_help/qpipopt.html @@ -44,31 +44,31 @@

Parameters

nbVar : -

a 1 x 1 matrix of doubles, number of variables

+

a double, number of variables

nbCon : -

a 1 x 1 matrix of doubles, number of constraints

+

a double, 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.

+

a symmetric matrix of doubles, represents coefficients of quadratic in the quadratic problem.

p : -

a n x 1 matrix of doubles, where n is number of variables, represents coefficients of linear in the quadratic problem

+

a vector of doubles, 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.

+

a vector of doubles, 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.

+

a vector 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

+

a matrix of doubles, 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.

+

a vector of doubles, 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.

+

a vector of doubles, contains upper bounds of the constraints.

x0 : -

a m x 1 matrix of doubles, where m is number of constraints, contains initial guess of variables.

+

a vector of doubles, contains initial guess of variables.

param :

a list containing the the parameters to be set.

xopt : -

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

+

a vector of doubles, the computed solution of the optimization problem.

fopt : -

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

+

a double, the function value at x.

exitflag :

Integer identifying the reason the algorithm terminated.

output : diff --git a/help/en_US/scilab_en_US_help/qpipoptmat.html b/help/en_US/scilab_en_US_help/qpipoptmat.html index 5e7518e..a9f97aa 100644 --- a/help/en_US/scilab_en_US_help/qpipoptmat.html +++ b/help/en_US/scilab_en_US_help/qpipoptmat.html @@ -47,29 +47,29 @@

Parameters

H : -

a n x n matrix of doubles, where n is number of variables, represents coefficients of quadratic in the quadratic problem.

+

a vector of doubles, where n is number of variables, represents coefficients of quadratic in the quadratic problem.

f : -

a n x 1 matrix of doubles, where n is number of variables, represents coefficients of linear in the quadratic problem

+

a vector of doubles, where n is number of variables, represents coefficients of linear in the quadratic problem

A : -

a m x n matrix of doubles, represents the linear coefficients in the inequality constraints

+

a vector of doubles, represents the linear coefficients in the inequality constraints

b : -

a column vector of doubles, represents the linear coefficients in the inequality constraints

+

a vector of doubles, represents the linear coefficients in the inequality constraints

Aeq : -

a meq x n matrix of doubles, represents the linear coefficients in the equality constraints

+

a matrix of doubles, represents the linear coefficients in the equality constraints

beq :

a vector of doubles, represents the linear coefficients in the equality constraints

LB : -

a n x 1 matrix of doubles, where n is number of variables, contains lower bounds of the variables.

+

a vector 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.

+

a vector of doubles, where n is number of variables, contains upper bounds of the variables.

x0 : -

a m x 1 matrix of doubles, where m is number of constraints, contains initial guess of variables.

+

a vector of doubles, contains initial guess of variables.

param :

a list containing the the parameters to be set.

xopt : -

a nx1 matrix of doubles, the computed solution of the optimization problem.

+

a vector of doubles, the computed solution of the optimization problem.

fopt : -

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

+

a double, the function value at x.

exitflag :

Integer identifying the reason the algorithm terminated.

output : @@ -100,7 +100,7 @@ find the minimum of f(x) such that

param = list("MaxIter", 300, "CpuTime", 100); //and minimize 0.5*x'*Q*x + p'*x with f=[1; 2; 3; 4; 5; 6]; H=eye(6,6); -[xopt,fopt,exitflag,output,lambda]=qpipoptmat(H,f,A,b,Aeq,beq,lb,ub,[],param); +[xopt,fopt,exitflag,output,lambda]=qpipoptmat(H,f,A,b,Aeq,beq,lb,ub,[],param) clear H f A b Aeq beq lb ub;

Examples

diff --git a/help/en_US/scilab_en_US_help/symphony.html b/help/en_US/scilab_en_US_help/symphony.html index a1e3eea..c5b8336 100644 --- a/help/en_US/scilab_en_US_help/symphony.html +++ b/help/en_US/scilab_en_US_help/symphony.html @@ -44,33 +44,33 @@

Parameters

nbVar : -

a 1 x 1 matrix of doubles, number of variables

+

a double, number of variables.

nbCon : -

a 1 x 1 matrix of doubles, number of constraints

+

a double, number of constraints.

objCoeff : -

a 1 x n matrix of doubles, where n is number of variables, contains coefficients of the variables in the objective

+

a 1 x n matrix of doubles, where n is number of variables, represents coefficients of the variables in the objective.

isInt : -

a 1 x n matrix of boolean, where n is number of variables, representing wether a variable is constrained to be an integer

+

a vector of boolean, represents wether a variable is constrained to be an integer.

LB : -

a 1 x n matrix of doubles, where n is number of variables, contains lower bounds of the variables. Bound can be negative infinity

+

a vector of doubles, represents 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. Bound can be infinity

+

a vector of doubles, represents 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

+

a matrix of doubles, represents 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.

+

a vector of doubles, represents 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

+

a vector of doubles, represents upper bounds of the constraints

objSense : -

The sense (maximization/minimization) of the objective. Use 1(sym_minimize ) or -1 (sym_maximize) here

+

The sense (maximization/minimization) of the objective. Use 1(sym_minimize ) or -1 (sym_maximize) here.

options : -

a 1xq marix of string, provided to set the paramters in symphony

+

a a list containing the the parameters to be set.

xopt : -

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

+

a vector of doubles, the computed solution of the optimization problem.

fopt : -

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

+

a double, the function value at x.

status : -

status flag from symphony

+

status flag from symphony.

output :

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

@@ -84,11 +84,11 @@ find the minimum or maximum of f(x) such that

Examples

//A basic case :
 // Objective function
-c = [350*5,330*3,310*4,280*6,500,450,400,100]
+c = [350*5,330*3,310*4,280*6,500,450,400,100]';
 // Lower Bound of variable
-lb = repmat(0,1,8);
+lb = repmat(0,8,1);
 // Upper Bound of variables
-ub = [repmat(1,1,4) repmat(%inf,1,4)];
+ub = [repmat(1,4,1);repmat(%inf,4,1)];
 // Constraint Matrix
 conMatrix = [5,3,4,6,1,1,1,1;
 5*0.05,3*0.04,4*0.05,6*0.03,0.08,0.07,0.06,0.03;
@@ -121,7 +121,7 @@ find the minimum or maximum of f(x) such that

957 798 669 625 467 1051 552 717 654 388 559 555 1104 783 .. 959 668 507 855 986 831 821 825 868 852 832 828 799 686 .. 510 671 575 740 510 675 996 636 826 1022 1140 654 909 799 .. -1162 653 814 625 599 476 767 954 906 904 649 873 565 853 1008 632] +1162 653 814 625 599 476 767 954 906 904 649 873 565 853 1008 632]'; //Constraint Matrix conMatrix = [ //Constraint 1 @@ -168,9 +168,9 @@ find the minimum or maximum of f(x) such that

nbCon = size(conMatrix,1) nbVar = size(conMatrix,2) // Lower Bound of variables -lb = repmat(0,1,nbVar) +lb = repmat(0,nbVar,1) // Upper Bound of variables -ub = repmat(1,1,nbVar) +ub = repmat(1,nbVar,1) // Row Matrix for telling symphony that the is integer or not isInt = repmat(%t,1,nbVar) // Lower Bound of constrains diff --git a/help/en_US/scilab_en_US_help/symphonymat.html b/help/en_US/scilab_en_US_help/symphonymat.html index 23ff2c6..8001136 100644 --- a/help/en_US/scilab_en_US_help/symphonymat.html +++ b/help/en_US/scilab_en_US_help/symphonymat.html @@ -45,9 +45,9 @@

Parameters

f : -

a 1xn matrix of doubles, where n is number of variables, contains coefficients of the variables in the objective

+

a vector of doubles, where n is number of variables, contains coefficients of the variables in the objective

intcon : -

Vector of integer constraints, specified as a vector of positive integers. The values in intcon indicate the components of the decision variable x that are integer-valued. intcon has values from 1 through number of variable

+

Vector of integer constraints, specified as a vector of positive integers. The values in intcon indicate the components of the decision variable x that are integer-valued. intcon has values from 1 through number of variable.

A :

Linear inequality constraint matrix, specified as a matrix of doubles. A represents the linear coefficients in the constraints A*x т‰Є b. A has size M-by-N, where M is the number of constraints and N is number of variables

b : @@ -72,7 +72,7 @@

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.

@@ -159,7 +159,7 @@ find the minimum or maximum of f(x) such that

// Upper Bound of variables ub = repmat(1,1,nbVar) // Lower Bound of constrains -intcon = [] +intcon = []; for i = 1:nbVar intcon = [intcon i]; end -- cgit