On the relative strength of different generalizations of split cuts

Split cuts are among the most important and well-understood cuts for general mixed-integer programs. In this paper we consider some recent generalizations of split cuts and compare their relative strength. More precisely, we compare the elementary closures of split, cross, crooked cross and general multi-branch split cuts as well as cuts obtained from multi-row and basic relaxations.We present a complete containment relationship between the closures of split, rank-2 split, cross, crooked cross and general multi-branch split cuts. More specifically, we show that 3-branch split cuts strictly dominate crooked cross cuts, which in turn strictly dominate cross cuts. We also show that multi-branch split cuts are incomparable to rank-2 split cuts. In addition, we also show that cross cuts, and hence crooked cross cuts, cannot always be obtained from 2-row relaxations or from basic relaxations. Together, these results settle some open questions raised in earlier papers.

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

[2]  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..

[3]  Kent Andersen,et al.  On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows , 2009, SIAM J. Optim..

[4]  G. Cornuéjols,et al.  Corner Polyhedron and Intersection Cuts , 2011 .

[5]  Matteo Fischetti,et al.  A relax-and-cut framework for Gomory mixed-integer cuts , 2011, Math. Program. Comput..

[6]  Sanjeeb Dash,et al.  On t-branch split cuts for mixed-integer programs , 2013, Math. Program..

[7]  Pierre Bonami.  On optimizing over lift-and-project closures , 2012, Math. Program. Comput..

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

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

[10]  Gérard Cornuéjols,et al.  Intersection Cuts with Infinite Split Rank , 2012, Math. Oper. Res..

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

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

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

[14]  Sanjeeb Dash,et al.  Computational Experiments with Cross and Crooked Cross Cuts , 2014, INFORMS J. Comput..

[15]  Sanjeeb Dash,et al.  A note on the MIR closure and basic relaxations of polyhedra , 2011, Oper. Res. Lett..

[16]  Sanjeeb Dash,et al.  A heuristic to generate rank-1 GMI cuts , 2010, Math. Program. Comput..

[17]  Gérard Cornuéjols,et al.  A Geometric Perspective on Lifting , 2011, Oper. Res..

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

[19]  Sanjeeb Dash,et al.  Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..

[20]  Sanjeeb Dash,et al.  On mixed-integer sets with two integer variables , 2011, Oper. Res. Lett..

[21]  Sanjay Mehrotra,et al.  A disjunctive cutting plane procedure for general mixed-integer linear programs , 2001, Math. Program..

[22]  Daniel Dadush,et al.  The split closure of a strictly convex body , 2011, Oper. Res. Lett..

[23]  Yanjun Li,et al.  Cook, Kannan and Schrijver's example revisited , 2008, Discret. Optim..

[24]  Sanjeeb Dash,et al.  Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming , 2014, Math. Program..

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

[26]  Matteo Fischetti,et al.  A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts , 2010, CPAIOR.

[27]  Sanjeeb Dash,et al.  Lattice-free sets, branching disjunctions, and mixed-integer programming , 2012 .

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

[29]  Laurence A. Wolsey,et al.  The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..

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

[31]  Laurence A. Wolsey,et al.  Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.