From a0d9443af147e949c1e6a01ac24749d12593ec5b Mon Sep 17 00:00:00 2001 From: Harpreet Date: Sat, 3 Sep 2016 00:36:51 +0530 Subject: cbcintlinprog added --- .../help/en_US/scilab_en_US_help/intfminbnd.html | 170 --------------------- 1 file changed, 170 deletions(-) delete mode 100644 newstructure/help/en_US/scilab_en_US_help/intfminbnd.html (limited to 'newstructure/help/en_US/scilab_en_US_help/intfminbnd.html') diff --git a/newstructure/help/en_US/scilab_en_US_help/intfminbnd.html b/newstructure/help/en_US/scilab_en_US_help/intfminbnd.html deleted file mode 100644 index c9dd359..0000000 --- a/newstructure/help/en_US/scilab_en_US_help/intfminbnd.html +++ /dev/null @@ -1,170 +0,0 @@ -
- -Solves a multi-variable optimization problem on a bounded interval
xopt = intfminbnd(f,intcon,x1,x2) -xopt = intfminbnd(f,intcon,x1,x2,options) -[xopt,fopt] = intfminbnd(.....) -[xopt,fopt,exitflag]= intfminbnd(.....) -[xopt,fopt,exitflag,output]=intfminbnd(.....) -[xopt,fopt,exitflag,gradient,hessian]=intfminbnd(.....)
a function, representing the objective function of the problem
a vector, containing the lower bound of the variables.
a vector, containing the upper bound of the variables.
a vector of integers, represents which variables are constrained to be integers
a list, containing the option for user to specify. See below for details.
a vector of doubles, containing the the computed solution of the optimization problem.
a scalar of double, containing the the function value at x.
a scalar of integer, containing the flag which denotes the reason for termination of algorithm. See below for details.
a vector of doubles, containing the Objective's gradient of the solution.
a matrix of doubles, containing the Objective's hessian of the solution.
Search the minimum of a multi-variable function on bounded interval specified by : -Find the minimum of f(x) such that
-The routine calls Bonmin for solving the Bounded Optimization problem, Bonmin is a library written in C++.
-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. -
The exitflag allows to know the status of the optimization which is given back by Ipopt. -
For more details on exitflag see the Bonmin documentation, go to http://www.coin-or.org/Bonmin
-//Find x in R^6 such that it minimizes: -//f(x)= sin(x1) + sin(x2) + sin(x3) + sin(x4) + sin(x5) + sin(x6) -//-2 <= x1,x2,x3,x4,x5,x6 <= 2 -//Objective function to be minimised -function y=f(x) -y=0 -for i =1:6 -y=y+sin(x(i)); -end -endfunction -//Variable bounds -x1 = [-2, -2, -2, -2, -2, -2]; -x2 = [2, 2, 2, 2, 2, 2]; -intcon = [2 3 4] -//Options -options=list("MaxIter",[1500],"CpuTime", [100]) -[x,fval] =intfminbnd(f ,intcon, x1, x2, options) -// Press ENTER to continue | ![]() | ![]() |
//The below problem is an unbounded problem: -//Find x in R^2 such that it minimizes: -//f(x)= -[(x1-1)^2 + (x2-1)^2] -//-inf <= x1,x2 <= inf -//Objective function to be minimised -function y=f(x) -y=-((x(1)-1)^2+(x(2)-1)^2); -endfunction -//Variable bounds -x1 = [-%inf , -%inf]; -x2 = [ %inf , %inf]; -//Options -options=list("MaxIter",[1500],"CpuTime", [100]) -[x,fval,exitflag,output,lambda] =intfminbnd(f,intcon, x1, x2, options) | ![]() | ![]() |