MIR closures of polyhedral sets

We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objective using additional variables to produce a linear MIP model that solves the separation problem exactly. Using a subset of these additional variables yields an MIP model which solves the separation problem approximately, with an accuracy that depends on the number of additional variables used. Our analysis yields an alternative proof of the result of Cook et al. (1990) that the split closure of a polyhedral set is again a polyhedron. We also discuss a heuristic to obtain MIR cuts based on our approximate separation model, and present some computational results.

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

[2]  Juan Pablo Vielma.  A constructive characterization of the split closure of a mixed integer linear program , 2007, Oper. Res. Lett..

[3]  Alberto Caprara,et al.  On the separation of split cuts and related inequalities , 2003, Math. Program..

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

[5]  Gérard Cornuéjols,et al.  Elementary closures for integer programs , 2001, Oper. Res. Lett..

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

[7]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

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

[9]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[10]  Gérard Cornuéjols,et al.  Valid inequalities for mixed integer linear programs , 2007, Math. Program..

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

[12]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[13]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[14]  Kent Andersen,et al.  Split closure and intersection cuts , 2002, Math. Program..

[15]  M. Minoux,et al.  Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation , 2005, Discret. Optim..

[16]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[17]  Egon Balas,et al.  A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..

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

[19]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[20]  Matteo Fischetti,et al.  Optimizing over the first Chvátal closure , 2005, Math. Program..

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

[22]  Gérard Cornuéjols,et al.  A note on the MIR closure , 2008, Oper. Res. Lett..

[23]  Friedrich Eisenbrand,et al.  NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..

[24]  Egon Balas,et al.  New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing , 2007, IPCO.

[25]  Gérard Cornuéjols,et al.  On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.

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

[27]  Matteo Fischetti,et al.  Projected Chvátal–Gomory cuts for mixed integer linear programs , 2008, Math. Program..