Abstract
From the fact that the constraint set (6.3) of (CGLP)j defines the convex hull of P ∩{x : x j ∈{0, 1}}, and that convP I, the integer hull, can be derived by imposing the disjunctions x j ≤ 0 ∨ x j ≥ 1 sequentially, it follows that any valid cut for a mixed 0-1 program can be represented as a lift-and-project cut.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
E. Balas and M. Perregaard, Lift-and-project for mixed 0-1 programming: Recent progress. Discrete Applied Mathematics, 123, 2002, 129–154.
E. Balas and M. Perregaard, A Precise Correspondence Between Lift-and-Project Cuts, Simple Disjunctive Cuts, and Mixed Integer Gomory Cuts for 0-1 Programming. Mathematical Programming B, 94, 2003, 221–245.
G. Cornuéjols, Y. Li, On the Rank of Mixed 0,1 Polyhedra, in K. Aardal et al. (editors), Integer Programming and Combinatorial Optimization Proceedings of IPCO 8. Lecture Notes in Computer Science, 2081, 2001, 71–77.
F. Eisenbrand and A. Schulz, Bounds on the Chvátal rank of polytopes in the 0-1 cube, in G. Cornuéjols et al. (editors), Integer Programming and Combinatorial Optimization, Proceedings of IPCO 7. Lecture Notes in Computer Science, 1610, 1999, 137–150.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Balas, E. (2018). The Correspondence Between Lift-and-Project Cuts and Simple Disjunctive Cuts. In: Disjunctive Programming. Springer, Cham. https://doi.org/10.1007/978-3-030-00148-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-00148-3_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00147-6
Online ISBN: 978-3-030-00148-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)