Optimal Cutting Planes from the Group Relaxations

We study quantitative criteria for evaluating the strength of valid inequalities for Gomory and Johnson's finite and infinite group models and we describe the valid inequalities that are optimal for these criteria. We justify and focus on the criterion of maximizing the volume of the nonnegative orthant cut off by a valid inequality. For the finite group model of prime order, we show that the unique maximizer is an automorphism of the {\em Gomory Mixed-Integer (GMI) cut} for a possibly {\em different} finite group problem of the same order. We extend the notion of volume of a simplex to the infinite dimensional case. This is used to show that in the infinite group model, the GMI cut maximizes the volume of the nonnegative orthant cut off by an inequality.

[1]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[2]  Ellis L. Johnson.  On the group problem for mixed integer programming , 1974 .

[3]  George L. Nemhauser,et al.  A finiteness proof for modified dantzig cuts in integer programming , 1970 .

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

[5]  Marco Di Summa,et al.  A geometric approach to cut-generating functions , 2015, Mathematical Programming.

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

[7]  Melvyn B. Nathanson,et al.  Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

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

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

[10]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

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

[12]  Marco Di Summa,et al.  The Structure of the Infinite Models in Integer Programming , 2019, Math. Oper. Res..

[13]  J. H. B. Kemperman.  On products of sets in a locally compact group , 1964 .

[14]  G. Dantzig.  Note on solving linear programs in integers , 1959 .

[15]  Matthias Köppe,et al.  Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms , 2016, 4OR.

[16]  Robert L. Graves,et al.  Technical Note - Strengthened Dantzig Cuts for Integer Programming , 1972, Oper. Res..

[17]  Matthias Köppe,et al.  Light on the Infinite Group Relaxation , 2014, ArXiv.

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

[19]  W. Rudin.  Principles of mathematical analysis , 1964 .

[20]  Ellis L. Johnson,et al.  T-space and cutting planes , 2003, Math. Program..

[21]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

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

[23]  R E Gomory,et al.  ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

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