Four Good Reasons to Use an Interior Point Solver Within a MIP Solver

“Interior point algorithms are a good choice for solving pure LPs or QPs, but when you solve MIPs, all you need is a dual simplex” This is the common conception which disregards that an interior point solution provides some unique structural insight into the problem at hand. In this paper, we will discuss some of the benefits that an interior point solver brings to the solution of difficult MIPs within FICO Xpress. This includes many different components of the MIP solver such as branching variable selection, primal heuristics, preprocessing, and of course the solution of the LP relaxation.

[1]  Richard Laundy,et al.  Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study , 2009, INFORMS J. Comput..

[2]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[3]  Matteo Fischetti,et al.  An In-Out Approach to Disjunctive Optimization , 2010, CPAIOR.

[4]  Timo Berthold,et al.  Measuring the impact of primal heuristics , 2013, Oper. Res. Lett..

[5]  Louis-Martin Rousseau,et al.  A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing , 2017, CPAIOR.

[6]  Matteo Fischetti,et al.  Boosting the feasibility pump , 2014, Mathematical Programming Computation.

[7]  Timo Berthold,et al.  Parallelization of the FICO Xpress-Optimizer , 2016, ICMS.

[8]  Matteo Fischetti,et al.  Proximity search for 0-1 mixed-integer convex programming , 2014, J. Heuristics.

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[10]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[11]  Joe Naoum-Sawaya.  Recursive central rounding for mixed integer programs , 2014, Comput. Oper. Res..

[12]  Fred W. Glover,et al.  The feasibility pump , 2005, Math. Program..

[13]  Jacek Gondzio,et al.  ACCPM — A library for convex optimization based on an analytic center cutting plane method☆ , 1996 .

[14]  C. Mészáros.  The BPMPD interior point solver for convex quadratic problems , 1999 .

[15]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[16]  W. Ben‐Ameur,et al.  Acceleration of cutting-plane and column generation algorithms: Applications to network design , 2007 .

[17]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[18]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[19]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[20]  G. Sonnevend,et al.  Applications of the notion of analytic center in approximation (estimation) problems , 1989 .

[21]  Jordi Castro,et al.  Using the analytic center in the feasibility pump , 2011, Oper. Res. Lett..