On the computational impact of MIQCP solver components

We provide a computational study of the performance of a state-of-the-art solver for nonconvex mixed-integer quadratically constrained programs (MIQCPs). Since successful general-purpose solvers for large problem classes necessarily comprise a variety of algorithmic techniques, we focus especially on the impact of the individual solver components. The solver SCIP used for the experiments implements a branch-and-cut algorithm based on linear outer approximation to solve MIQCPs to global optimality. Our analysis is based on a set of 86 publicly available test instances.

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

[2]  Timo Berthold.  Primal Heuristics for Mixed Integer Programs , 2006 .

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

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

[5]  Michael R. Bussieck,et al.  MINLP Solver Software , 2011 .

[6]  Tallys H. Yunes,et al.  An Integrated Solver for Optimization Problems , 2010, Oper. Res..

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

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

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

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

[11]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[12]  Arnold Neumaier,et al.  Constraint propagation on quadratic constraints , 2010, Constraints.

[13]  George L. Nemhauser,et al.  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..

[14]  Timo Berthold,et al.  A primal heuristic for MINLP based on sub-MIPs generated by set covering , 2009 .

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

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

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

[18]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[19]  Thorsten Koch,et al.  Constraint Integer Programming: A New Approach to Integrate CP and MIP , 2008, CPAIOR.