Numerically Safe Gomory Mixed-Integer Cuts

We describe a simple process for generating numerically safe cutting planes using floating-point arithmetic and the mixed-integer rounding procedure. Applying this method to the rows of the simplex tableau permits the generation of Gomory mixed-integer cuts that are guaranteed to be satisfied by all feasible solutions to a mixed-integer programming problem (MIP). We report on tests with the MIPLIB 3.0 and MIPLIB 2003 test collections as well as with MIP instances derived from the TSPLIB traveling salesman library.

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

[2]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[3]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[4]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[5]  Egon Balas,et al.  Optimizing over the split closure , 2008, Math. Program..

[6]  Arnold Neumaier,et al.  Safe bounds in linear and mixed-integer linear programming , 2004, Math. Program..

[7]  François Margot,et al.  Testing cut generators for mixed-integer linear programming , 2009, Math. Program. Comput..

[8]  Andrea Lodi,et al.  MIR closures of polyhedral sets , 2009, Math. Program..

[9]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

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

[11]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[12]  William J. Cook,et al.  Exact solutions to linear programming problems , 2007, Oper. Res. Lett..

[13]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[14]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[15]  Marcos G. Goycoolea,et al.  Cutting Planes for Large Mixed Integer Programming Models , 2006 .

[16]  Daniel G. Espinoza.  On Linear Programming, Integer Programming and Cutting Planes , 2006 .

[17]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[18]  Egon Balas,et al.  Integer Programming , 2021, Encyclopedia of Optimization.

[19]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[20]  Robert E. Bixby,et al.  Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

[21]  Sanjeeb Dash,et al.  Two-Step MIR Inequalities for Mixed Integer Programs , 2010, INFORMS J. Comput..

[22]  Andrea Lodi,et al.  On the MIR Closure of Polyhedra , 2007, IPCO.

[23]  Ansi Ieee,et al.  IEEE Standard for Binary Floating Point Arithmetic , 1985 .

[24]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[25]  Gérard Cornuéjols,et al.  K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau , 2003, INFORMS J. Comput..

[26]  R. Bixby.  An Updated Mixed Integer Programming Library MIPLIB , 1998 .