Minimal Valid Inequalities for Integer Constraints

In this paper, we consider a semi-infinite relaxation of mixed-integer linear programs. We show that minimal valid inequalities for this relaxation correspond to maximal lattice-free convex sets, and that they arise from nonnegative, piecewise linear, positively homogeneous, convex functions.

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

[2]  Jean-Philippe P. Richard,et al.  Sequential-Merge Facets for Two-Dimensional Group Problems , 2007, IPCO.

[3]  Giacomo Zambelli,et al.  On degenerate multi-row Gomory cuts , 2009, Oper. Res. Lett..

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

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

[6]  Jean-Philippe P. Richard,et al.  Facets of Two-Dimensional Infinite Group Problems , 2008, Math. Oper. Res..

[7]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

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

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

[10]  H. Scarf.  An observation on the structure of production sets with indivisibilities. , 1977, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[13]  Daniel G. Espinoza.  Computing with Multi-row Gomory Cuts , 2008, IPCO.

[14]  Jean-Paul Doignon,et al.  Convexity in cristallographical lattices , 1973 .

[15]  David E. Bell.  A Theorem Concerning the Integer Lattice , 1977 .

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

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

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

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

[20]  Gérard Cornuéjols,et al.  On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints , 2008, LATIN.

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

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