Sequence Independent Lifting for Mixed-Integer Programming

Lifting is a procedure for deriving strong valid inequalities for a closed set from inequalities that are valid for its lower dimensional restrictions. It is arguably one of the most effective ways of strengthening linear programming relaxations of 0–1 programming problems. Wolsey (1977) and Gu et al. (2000) show that superadditive lifting functions lead to sequence independent lifting of valid inequalities for monotone 0–1 programming and for monotone mixed 0–1 programming, respectively. We show that this property holds for general mixed-integer programming (MIP) as well if lower dimensional restrictions are obtained by setting integer variables to a bound. Lifting with general integer variables is computationally harder than lifting with 0–1 variables, because the former requires the solution of nonlinear integer problems rather than linear integer problems. Here we see that nonlinearity in lifting problems is resolved easily with superadditive lifting functions. The results presented here may pave the way for efficient applications of lifting with general integer variables.

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

[2]  Laurence A. Wolsey,et al.  Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

[3]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

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

[5]  Martin W. P. Savelsbergh,et al.  Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[6]  Eitan Zemel,et al.  Lifting the facets of zero–one polytopes , 1978, Math. Program..

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

[8]  Alper Atamtürk,et al.  On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..

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

[10]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[11]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[12]  Gérard Cornuéjols,et al.  K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau , 2003, INFORMS J. Comput..

[13]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .

[14]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Computation , 1998, INFORMS J. Comput..

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

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

[17]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

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

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

[20]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

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