An Outer-Inner Approximation for separable MINLPs

A common structure in convex mixed-integer nonlinear programs 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. These methods have been implemented in the open source solver Bonmin and are available for download from the COIN-OR 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 average computing time on most tested instances.

[1]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[2]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[3]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[4]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[5]  I. Grossmann,et al.  Logic-based MINLP algorithms for the optimal synthesis of process networks , 1996 .

[6]  Ignacio E. Grossmann,et al.  LOGMIP: a disjunctive 0–1 nonlinear optimizer for process systems models , 1997 .

[7]  David W.T. Rippin,et al.  Optimal design of a multi-product batch plant , 1998 .

[8]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[9]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[10]  Tapio Westerlund,et al.  Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods , 2005, Comput. Chem. Eng..

[11]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[12]  Walid Ben-Ameur,et al.  Mathematical Models of the Delay Constrained Routing Problem , 2006, Algorithmic Oper. Res..

[13]  Claudio Gentile,et al.  Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..

[14]  Samir Elhedhli,et al.  Service System Design with Immobile Servers, Stochastic Demand, and Congestion , 2006, Manuf. Serv. Oper. Manag..

[15]  Oktay Günlük,et al.  IBM Research Report MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL , 2007 .

[16]  Oktay Günlük,et al.  Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables , 2008, IPCO.

[17]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[18]  Iiro Harjunkoski,et al.  MINLP: Trim-loss Problem , 2009, Encyclopedia of Optimization.

[19]  Sven Leyffer,et al.  FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs , 2010, INFORMS J. Comput..

[20]  Hassan L. Hijazi,et al.  Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications , 2010, Electron. Notes Discret. Math..

[21]  Jon Lee,et al.  Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations , 2011, Math. Program..

[22]  Jeff T. Linderoth,et al.  Algorithms and Software for Convex Mixed Integer Nonlinear Programs , 2012 .

[23]  Hassan L. Hijazi,et al.  Mixed-integer nonlinear programs featuring “on/off” constraints , 2012, Comput. Optim. Appl..