Hello again,
I have a question about the solver that is going to be used to solve a problem.
In the first example of this page:
I just added this command, after the Initial Guess:
% Options
opts = optiset('solver','nomad','display','iter')
And even tried other solvers (like scip, for example)
But it's still using Bonmin to solve the problem, as you can see from the results:
opts =
solver: 'nomad'
maxiter: 1500
maxfeval: 10000
maxnodes: 10000
maxtime: 1000
tolrfun: 1.0000e-07
tolafun: 1.0000e-07
tolint: 1.0000e-05
solverOpts: []
dynamicOpts: []
iterfun: []
warnings: 'critical'
display: 'iter'
derivCheck: 'off'
------------------------------------------------------
Mixed Integer Nonlinear Program (MINLP) Optimization
min f(x)
s.t. rl <= Ax <= ru
lb <= x <= ub
cl <= c(x) <= cu
xi = Integer / Binary
------------------------------------------------------
Problem Properties:
# Decision Variables: 4
# Constraints: 11
# Linear Inequality: 2
# Bounds: 6
# Binary Variables: 1
# Integer Variables: 1
# Nonlinear Inequality: 1
------------------------------------------------------
Solver Parameters:
Solver: BONMIN
Objective Gradient: @(x)mklJac(prob.fun,x,1) [numdiff]
Constraint Jacobian: @(x)mklJac(prob.nlcon,x,nnl) [numdiff]
Jacobian Structure: Assumed 100% Dense
Lagrangian Hessian: Not Supplied
Hessian Structure: Assumed 100% Dense
------------------------------------------------------
x =
1.0000
1.0000
0.5001
0
fval =
-2.5001
exitflag =
1
info =
Iterations: 0
Nodes: 0
AbsGap: 0.1179
RelGap: 0.0453
Time: 0.0956
Algorithm: 'BONMIN: Branch & Bound using IPOPT & CBC'
Status: 'Success'
Is there anything i'm doing wrong here? Sorry for the long post and probably for the silly question, i'm just not that good at programming/Matlab.