On the polyhedrality of cross and quadrilateral closures

Split cuts form a well-known class of valid inequalities for mixed-integer programming problems. Cook et al. (Math Program 47:155–174, 1990) showed that the split closure of a rational polyhedron P is again a polyhedron. In this paper, we extend this result from a single rational polyhedron to the union of a finite number of rational polyhedra. We then use this result to prove that cross cuts yield closures that are rational polyhedra. Cross cuts are a generalization of split cuts introduced by Dash et al. (Math Program 135:221–254, 2012). Finally, we show that the quadrilateral closure of the two-row continuous group relaxation is a polyhedron, answering an open question in Basu et al. (Math Program 126:281–314, 2011).

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

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

[3]  Daniel Dadush,et al.  On the Chvátal–Gomory closure of a compact convex set , 2010, Math. Program..

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

[5]  Gérard Cornuéjols,et al.  On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs , 2015, Math. Program..

[6]  Gérard Cornuéjols,et al.  On the relative strength of split, triangle and quadrilateral cuts , 2009, Math. Program..

[7]  Laurence A. Wolsey,et al.  Two row mixed-integer cuts via lifting , 2010, Math. Program..

[8]  Thøger Bang,et al.  A solution of the “plank problem.” , 1951 .

[9]  Alberto Del Pia,et al.  On convergence in mixed integer programming , 2012, Math. Program..

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

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

[12]  Robert Weismantel,et al.  Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three , 2010, Math. Oper. Res..

[13]  Alexander Schrijver,et al.  On Cutting Planes , 1980 .

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

[15]  Matthias Köppe,et al.  The triangle closure is a polyhedron , 2011, Math. Program..

[16]  Kent Andersen,et al.  An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets , 2009, Math. Oper. Res..

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

[18]  Gennadiy Averkov.  On finitely generated closures in the theory of cutting planes , 2012, Discret. Optim..

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

[20]  Andreas S. Schulz,et al.  The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope , 2012, OR.

[21]  Andreas S. Schulz,et al.  The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope , 2013, Math. Oper. Res..

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