| |
|
|
multiMin
multiMin solves general constrained mixed-integer global optimization problems.
It tries to find all local minima by a multi-start method using a
suitable nonlinear programming subsolver.
Main features
-
Possible to supply a matrix of starting points or let the solver use randomly generated numbers within bounds.
-
Warm start capabilities included.
-
The solver may be terminated when a specific goal has been achieved.
-
Local searches may be avoided by giving a upper bound on the objective.
-
If generating random points and there are linear constraints, multiMin
checks feasibility with respect to the linear constraints, and for each
initial point tries 100 times to get linear feasibility before accepting the
initial point.
|
|
