Two-Step MIR Inequalities for Mixed Integer Programs

Two-step mixed integer rounding (MIR) inequalities are valid inequalities derived from a facet of a simple mixed integer set with three variables and one constraint. In this paper we investigate how to effectively use these inequalities as cutting planes for general mixed integer problems. We study the separation problem for single-constraint sets and show that it can be solved in polynomial time when the resulting inequality is required to be sufficiently different from the associated MIR inequalities. We discuss computational issues and present numerical results based on a number of data sets.

[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]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

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

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

[6]  Lisa Evans,et al.  Cyclic group and knapsack facets with applications to cutting planes , 2002 .

[7]  Ricardo Fukasawa,et al.  On the exact separation of mixed integer knapsack cuts , 2007, Math. Program..

[8]  Sanjeeb Dash,et al.  Production design for plate products in the steel industry , 2007, IBM J. Res. Dev..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[23]  Sanjeeb Dash,et al.  On the strength of Gomory mixed-integer cuts as group cuts , 2008, Math. Program..

[24]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..