On the strength of Gomory mixed-integer cuts as group cuts

Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be derived from facets of Gomory’s master cyclic group polyhedron and its mixed-integer extension studied by Gomory and Johnson. In this paper we examine why cutting planes derived from other facets of master cyclic group polyhedra (group cuts) do not seem to be as useful when used in conjunction with GMI cuts. For many practical problem instances, we numerically show that once GMI cuts from different rows of the optimal simplex tableau are added to the formulation, all other group cuts from the same tableau rows are satisfied.

[1]  Matteo Fischetti,et al.  Mixed-Integer Cuts from Cyclic Groups , 2007, Math. Program..

[2]  Alper Atamtürk,et al.  On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..

[3]  Sanjeeb Dash,et al.  Valid inequalities based on simple mixed-integer sets , 2006, Math. Program..

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

[5]  Ellis L. Johnson,et al.  Corner Polyhedra and their connection with cutting planes , 2003, Math. Program..

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

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

[8]  Sanjeeb Dash,et al.  Valid inequalities based on the interpolation procedure , 2006, Math. Program..

[9]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[10]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[11]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra, II , 1972, Math. Program..

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

[13]  Ellis L. Johnson,et al.  Cyclic group and knapsack facets , 2003, Math. Program..

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

[15]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

[17]  Matteo Fischetti,et al.  Mixed-Integer Cuts from Cyclic Groups , 2005, IPCO.

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

[19]  Sanjeeb Dash,et al.  Valid inequalities based on simple mixed-integer sets , 2004, Math. Program..

[20]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

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