The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Copyright policy )The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
AbstractThis paper presents a new two-phase method for solving convex mixed-integer nonlinear programming (MINLP) problems, called Decomposition-based Outer Approximation Algorithm (DECOA). In the first phase, a sequence of linear integer relaxed sub-problems (LP phase) is solved in order to rapidly generate a good linear relaxation of the original MINLP problem. In the second phase, the algorithm solves a sequence of mixed integer linear programming sub-problems (MIP phase). In both phases the outer approximation is improved iteratively by adding new supporting hyperplanes by solving many easier sub-problems in parallel. DECOA is implemented as a part of Decogo (Decomposition-based Global Optimizer), a parallel decomposition-based MINLP solver implemented in Python and Pyomo. Preliminary numerical results based on 70 convex MINLP instances up to 2700 variables show that due to the generated cuts in the LP phase, on average only 2–3 MIP problems have to be solved in the MIP phase.
- Hamburg University of Applied Science Germany
- Wageningen University & Research Netherlands
- Hamburg University of Applied Sciences Germany
- University of Malaga Spain
- Hochschule für Angewandte Wissenschaften Hamburg Germany
ddc:510, Outer approximation, Convex programming, Programación no convexa, Decomposition, convex MINLP, global optimization, DECOA, Approximation methods and heuristics in mathematical programming, 510, 519, Programación no lineal, Mixed integer programming, decomposition method, Convex MINLP, Global optimization, Decomposition method, outer approximation
ddc:510, Outer approximation, Convex programming, Programación no convexa, Decomposition, convex MINLP, global optimization, DECOA, Approximation methods and heuristics in mathematical programming, 510, 519, Programación no lineal, Mixed integer programming, decomposition method, Convex MINLP, Global optimization, Decomposition method, outer approximation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).16 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!