Abstract
We investigate lifting, i.e., the process of taking a valid inequality for a polyhedron and extending it to a valid inequality in a higher dimensional space. Lifting is usually applied sequentially, that is, variables in a set are lifted one after the other. This may be computationally unattractive since it involves the solution of an optimization problem to compute a lifting coefficient for each variable. To relieve this computational burden, we study sequence independent lifting, which only involves the solution of one optimization problem. We show that if a certain lifting function is superadditive, then the lifting coefficients are independent of the lifting sequence. We introduce the idea of valid superadditive lifting functions to obtain good aproximations to maximum lifting. We apply these results to strengthen Balas' lifting theorem for cover inequalities and to produce lifted flow cover inequalities for a single node flow problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, “Facets of the Knapsack polytope,” Mathematical Programming, vol. 8, pp. 146-164, 1975.
E. Balas and E. Zemel, “Facets of the Knapsack polytope from minimal covers,” SIAM Journal on Applied Mathematics, vol. 34, pp. 119-148, 1978.
H. Crowder, E.L. Johnson, and M.W. Padberg, “Solving large scale zero-one linear programming problems,” Operations Research, vol. 31, pp. 803-834, 1983.
R.E. Gomory, “Some polyhedra related to combinatorial problems,” Linear Algebra and Its Applications, vol. 2, pp. 451-558, 1969.
Z. Gu, “Lifted cover inequalities for 0-1 and mixed integer programs,” Ph.D. Thesis, Georgia Institute of Technology, 1994.
Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, “Lifted cover inequalities for 0-1 integer programs: Computation,” INFORMS Journal on Computing, vol. 10, pp. 427-437, 1998.
Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh, Lifted Flow Cover Inequalities for Mixed 0-1 Integer Programs. Report LEC-96-05, Georgia Institute of Technology, Atlanta, Mathematical Programming, vol. 85, pp. 439-468, 1999.
H. Marchand and L.A. Wolsey, “The 0-1 knapsack problem with a single continuous variable,” Mathematical Programming, vol. 85, pp. 15-33, 1999.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. Wiley: New York, 1988.
M.W. Padberg, “On the facial structure of set packing polyhedra,” Mathematical Programming, vol. 5, pp. 199-215, 1973.
M.W. Padberg, T.J. Van Roy, and L.A. Wolsey, “Valid linear inequalities for fixed charge problems,” Operations Research, vol. 33, pp. 842-861, 1985.
Y. Pochet, “A note on lifting single node flow cover inequalities,” Unpublished manuscript, 1993.
T.J. Van Roy and L.A. Wolsey, “Valid inequalities for mixed 0-1 programs,” Discrete Applied Mathematics, vol. 14, pp. 199-213, 1986.
L.A. Wolsey, “Facets and strong valid inequalities for integer programs,” Operations Research, vol. 24, pp. 367-372, 1976.
L.A. Wolsey, “Valid inequalities and superadditivity for 0-1 integer programs,” Mathematics of Operations Research, vol. 2, pp. 66-77, 1977.
E. Zemel, “Lifting the facets of zero-one polytopes,” Mathematical Programming, vol. 15, pp. 268-277, 1978.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gu, Z., Nemhauser, G.L. & Savelsbergh, M.W. Sequence Independent Lifting in Mixed Integer Programming. Journal of Combinatorial Optimization 4, 109–129 (2000). https://doi.org/10.1023/A:1009841107478
Issue Date:
DOI: https://doi.org/10.1023/A:1009841107478