Intersection Cuts with Infinite Split Rank

We consider mixed-integer linear programs where free integer variables are expressed in terms of nonnegative continuous variables. When this model only has two integer variables, Dey and Louveaux characterized the intersection cuts that have infinite split rank. We show that, for any number of integer variables, the split rank of an intersection cut generated from a rational lattice-free polytope L is finite if and only if the integer points on the boundary of L satisfy a certain “2-hyperplane property.” The Dey--Louveaux characterization is a consequence of this more general result.

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

[2]  L. Wolsey,et al.  Cutting Planes form Two Rows of a Simplex Tableau , 2007 .

[3]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.

[4]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[5]  Santanu S. Dey,et al.  Split Rank of Triangle and Quadrilateral Inequalities , 2009, Math. Oper. Res..

[6]  Laurence A. Wolsey,et al.  Lifting integer variables in minimal inequalities corresponding , 2008 .

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

[8]  J. Graver,et al.  Graduate studies in mathematics , 1993 .

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

[10]  Fan Chung Graham,et al.  Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm , 2007, TAMC.

[11]  Gérard Cornuéjols,et al.  Minimal Valid Inequalities for Integer Constraints , 2009, Math. Oper. Res..

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

[13]  Gérard Cornuéjols,et al.  On the facets of mixed integer programs with two integer variables and two constraints , 2008, Math. Program..

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

[15]  Laurence A. Wolsey,et al.  Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles , 2008, IPCO.

[16]  Raymond Séroul.  Programming for Mathematicians , 2000 .

[17]  Claus-Peter Schnorr,et al.  Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.

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

[19]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.