|
|
|
minlpSolve
minlpSolve is a Branch and Bound algorithm for Mixed-Integer Nonlinear Programming (MINLP) with convex or nonconvex sub problems using NLP relaxation (Formulated as minlp-IP).
Main features
-
A parameter Convex determines if the NLP subproblems are convex or not.
-
The solver has several options for node selection, such as depth and breath first.
-
It is possible to warm start the solution process.
-
Several solver options, such as variable priority, knapsack and rounding heuristics are available.
|
|