An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs

Hassan Hijazi, Pierre Bonami, Adam Ouorou
2014 INFORMS journal on computing  
A common structure in convex mixed-integer nonlinear programs (MINLPs) is separable nonlinear functions. In the presence of such structures, we propose three improvements to the outer approximation algorithms. The first improvement is a simple extended formulation, the second is a refined outer approximation, and the third is a heuristic inner approximation of the feasible region. As a side result, we exhibit a simple example where a classical implementation of the outer approximation would
more » ... an exponential number of iterations, whereas it is easily solved with our modifications. These methods have been implemented in the open source solver Bonmin and are available for download from the Computational Infrastructure for Operations Research project website. We test the effectiveness of the approach on three real-world applications and on a larger set of models from an MINLP benchmark library. Finally, we show how the techniques can be extended to perspective formulations of several problems. The proposed tools lead to an important reduction in computing time on most tested instances.
doi:10.1287/ijoc.1120.0545 fatcat:bdpadkeu5zgazlpnht5sxafpqm