| |
|
|
ecpMINLP
ecpMINLP
solves convex or pseudo-convex mixed-integer
nonlinear programming (MINLP) problems.
Main features
-
ecpMINLP
is using an extended cutting plane algorithm
with cuts regulated by a parameter-vector alpha.
Cuts and linearizations
are added to MIP subproblem which is then solved by a subsolver in each
iteration.
-
The ecpMINLP solver algorithm is mainly based on the paper
Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques'
Optimization and Engineering 3,
253-280, 2002,
by Tapio Westerlund and Ray Pörn,
but with several modifications.
-
ecpMINLP
needs a mixed-integer programming (MIP) subsolver, Tomlab /CPLEX is
the recommended solver.
-
ecpMINLP
is integrated with the TOMLAB driver routines.
-
ecpMINLP
may be used as subproblem solver in the TOMLAB environment.
|
|
