Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 64, Issue 2, Pages 249-272Publisher
SPRINGER
DOI: 10.1007/s10898-015-0322-3
Keywords
Convex MINLP; Extended supporting hyperplane (ESH) algorithm; Extended cutting plane (ECP) algorithm; Supporting hyperplanes; Cutting planes; Supporting hyperplane optimization toolkit (SHOT)
Funding
- Foundation of Abo Akademi University
- Center of Excellence in Optimization and Systems Engineering
- GAMS Development Corporation
- Finnish Graduate School in Chemical Engineering
Ask authors/readers for more resources
A new deterministic algorithm for solving convex mixed-integer nonlinear programming (MINLP) problems is presented in this paper: The extended supporting hyperplane (ESH) algorithm uses supporting hyperplanes to generate a tight overestimated polyhedral set of the feasible set defined by linear and nonlinear constraints. A sequence of linear or quadratic integer-relaxed subproblems are first solved to rapidly generate a tight linear relaxation of the original MINLP problem. After an initial overestimated set has been obtained the algorithm solves a sequence of mixed-integer linear programming or mixed-integer quadratic programming subproblems and refines the overestimated set by generating more supporting hyperplanes in each iteration. Compared to the extended cutting plane algorithm ESH generates a tighter overestimated set and unlike outer approximation the generation point for the supporting hyperplanes is found by a simple line search procedure. In this paper it is proven that the ESH algorithm converges to a global optimum for convex MINLP problems. The ESH algorithm is implemented as the supporting hyperplane optimization toolkit (SHOT) solver, and an extensive numerical comparison of its performance against other state-of-the-art MINLP solvers is presented.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available