|
|
|
cutPlane
The Tomlab solver cutPlane.m solves mixed-integer linear programming problems (MIP) with equality constraints using a cutting plane algorithm with LP relaxation.
Main features
-
All decision variables have to be greater than or equal to zero.
-
Selectable LP and dual LP solver.
|
|