A Geometric Perspective on Lifting

Recently it has been shown that minimal inequalities for a continuous relaxation of mixed-integer linear programs are associated with maximal lattice-free convex sets. In this paper, we show how to lift these inequalities for integral nonbasic variables by considering maximal lattice-free convex sets in a higher dimensional space. We apply this approach to several examples. In particular, we identify cases in which the lifting is unique.

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

[2]  Daniel G. Espinoza Computing with multi-row Gomory cuts , 2008, Oper. Res. Lett..

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

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

[5]  Martin W. P. Savelsbergh,et al.  Sequence Independent Lifting in Mixed Integer Programming , 2000, J. Comb. Optim..

[6]  E. Balas,et al.  Strengthening cuts for mixed integer programs , 1980 .

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

[8]  Gérard Cornuéjols,et al.  Maximal Lattice-Free Convex Sets in Linear Subspaces , 2010, Math. Oper. Res..

[9]  Gérard Cornuéjols,et al.  A counterexample to a conjecture of Gomory and Johnson , 2010, Mathematical Programming.

[10]  Laurence A. Wolsey,et al.  Valid Inequalities and Superadditivity for 0-1 Integer Programs , 1977, Math. Oper. Res..

[11]  A. Atamtūrk,et al.  Sequence Independent Lifting for Mixed-Integer Programming , 2004 .

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

[13]  Gérard Cornuéjols,et al.  Minimal Inequalities for an Infinite Relaxation of Integer Programs , 2010, SIAM J. Discret. Math..

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

[15]  Laurence A. Wolsey,et al.  Lifting group inequalities and an application to mixing inequalities , 2009 .

[16]  Giacomo Zambelli,et al.  Convex Sets and Minimal Sublinear Functions , 2010 .

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

[18]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

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

[20]  Laurence A. Wolsey,et al.  Constrained Infinite Group Relaxations of MIPs , 2010, SIAM J. Optim..