Valid inequalities based on simple mixed-integer sets

In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these inequalities two-step MIR inequalities as they can be derived by applying the simple mixed-integer rounding (MIR) principle of Wolsey (1998) twice. The two-step MIR inequalities define facets of the master cyclic group polyhedron of Gomory (1969). In addition, they dominate the strong fractional cuts of Letchford and Lodi (2002).

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

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

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

[4]  Miguel Fragoso Constantino,et al.  Description of 2-integer continuous knapsack polyhedra , 2006, Discret. Optim..

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

[6]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

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

[8]  Laurence A. Wolsey,et al.  Non-standard approaches to integer programming , 2002, Discret. Appl. Math..

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

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

[11]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

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

[13]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

[15]  Andrea Lodi,et al.  Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..

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

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

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