MINLP Solver Software

In this article we give a brief overview of the start-of-the-art in software for the solution of mixed integer nonlinear programs (MINLP). We establish several groupings with respect to various features and give concise individual descriptions for each solver. The provided information may guide the selection of a best solver for a particular MINLP problem. Keywords: mixed integer nonlinear programming; solver; software; MINLP; MIQCP

[1]  Stefan Vigerske,et al.  LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs , 2008, Central Eur. J. Oper. Res..

[2]  Julio R. Banga,et al.  Extended ant colony optimization for non-convex mixed integer nonlinear programming , 2009, Comput. Oper. Res..

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

[4]  Edward M. B. Smith,et al.  A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs , 1999 .

[5]  T. Westerlund,et al.  An extended cutting plane method for solving convex MINLP problems , 1995 .

[6]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[7]  Kenneth Holmström,et al.  The TOMLAB Optimization Environment , 2004 .

[8]  Nikolaos V. Sahinidis,et al.  BARON: A general purpose global optimization software package , 1996, J. Glob. Optim..

[9]  Nikolaos V. Sahinidis,et al.  Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs , 2009, Optim. Methods Softw..

[10]  Marcel Roelofs,et al.  AIMMS 3.8 - Language Reference , 2008 .

[11]  Klaus Schittkowski,et al.  A trust region SQP algorithm for mixed-integer nonlinear programming , 2007, Optim. Lett..

[12]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[13]  Ignacio E. Grossmann,et al.  Computational experience with dicopt solving MINLP problems in process systems engineering , 1989 .

[14]  Timo Berthold,et al.  Extending a CIP framework to solve MIQCPs , 2012 .

[15]  Sonia Cafieri,et al.  Reformulations in Mathematical Programming: A Computational Approach , 2009, Foundations of Computational Intelligence.

[16]  Klaus Schittkowski,et al.  A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization , 2012, Math. Program. Comput..

[17]  Paul I. Barton,et al.  McCormick-Based Relaxations of Algorithms , 2009, SIAM J. Optim..

[18]  C. Adjiman,et al.  Global optimization of mixed‐integer nonlinear problems , 2000 .

[19]  John C. Plummer,et al.  Scatter Search and Local Nlp Solvers: A Multistart Framework for Global Optimization , 2006 .

[20]  Matthias Gerdts,et al.  The oracle penalty method , 2010, J. Glob. Optim..

[21]  Christodoulos A. Floudas,et al.  GloMIQO: Global mixed-integer quadratic optimizer , 2012, Journal of Global Optimization.

[22]  Christodoulos A. Floudas,et al.  Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations , 2012, Mathematical Programming.

[23]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[24]  Sven Leyffer,et al.  Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming , 2001, Comput. Optim. Appl..

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

[26]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[27]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[28]  T. Westerlund,et al.  Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques , 2002 .

[29]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

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

[31]  Christodoulos A. Floudas,et al.  Rigorous convex underestimators for general twice-differentiable problems , 1996, J. Glob. Optim..

[32]  A. Lodi,et al.  On the optimal design of water distribution networks: a practical MINLP approach , 2012 .

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

[34]  Matthias Gerdts,et al.  A numerical study of MIDACO on 100 MINLP benchmarks , 2012 .

[35]  Ashutosh Mahajan,et al.  Exploiting Second-Order Cone Structure for Global Optimization , 2010 .

[36]  Jeff T. Linderoth,et al.  FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .

[37]  Ignacio E. Grossmann,et al.  Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation , 2003, Comput. Optim. Appl..

[38]  Thomas Lehmann.  On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems , 2013 .

[39]  Michael C. Ferris,et al.  An extended mathematical programming framework , 2009, Comput. Chem. Eng..

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

[41]  Arne Stolbjerg Drud,et al.  CONOPT - A Large-Scale GRG Code , 1994, INFORMS J. Comput..

[42]  Kenneth Holmstrom,et al.  The TOMLAB Optimization Environment in Matlab , 1999 .

[43]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[44]  Linus Schrage,et al.  The global solver in the LINDO API , 2009, Optim. Methods Softw..

[45]  Robin Lougee,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003, IBM J. Res. Dev..

[46]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[47]  Christodoulos A. Floudas,et al.  αBB: A global optimization method for general constrained nonconvex problems , 1995, J. Glob. Optim..

[48]  Michael R. Bussieck,et al.  MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming , 2003, INFORMS J. Comput..

[49]  Hande Y. Benson.  Mixed integer nonlinear programming using interior-point methods , 2011, Optim. Methods Softw..

[50]  N. Sahinidis,et al.  Solving Global Optimization Problems with Baron , 2001 .

[51]  John A. Tomlin,et al.  Branch and bound, integer, and non-integer programming , 2007, Ann. Oper. Res..

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

[53]  S. Leyffer,et al.  Solving Mixed-Integer Nonlinear Programs by QP-Diving , 2012 .

[54]  im Fach Mathematik , .

[55]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[56]  Linus Schrage,et al.  Implementation and Testing of a Branch-and-Bound Based Method for Deterministic Global Optimization: Operations Research Applications , 2004 .

[57]  Endre Rev,et al.  New MINLP Model and Modified Outer Approximation Algorithm for Distillation Column Synthesis , 2008 .

[58]  Fred W. Glover,et al.  Scatter Search and Local Nlp Solvers: A Multistart Framework for Global Optimization , 2006, INFORMS J. Comput..

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