Abstract
We discuss a procedure to obtain facets and valid inequalities for the convex hull of the set of solutions to a general zero–one programming problem. Basically, facets and valid inequalities defined on lower dimensional subpolytopes are lifted into the space of the original problem. The procedure generalizes the previously known techniques for lifting facets in two respects. First, the general zero–one programming problem is considered rather than various special cases. Second, the procedure is exhaustive in the sense that it accounts for all the facets (valid inequalities) which are liftings of a given lower dimensional facet (valid inequality).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.A. Araoz Durand, “Polyhedral neopolarities”, Ph.D. Thesis, University of Waterloo, Faculty of Mathematics, Department of Applied Analysis and Computer Science (1974).
E. Balas, “Facets of the knapsack polytope”,Mathematical Programming 8 (1975) 146–164.
E. Balas, “Disjunctive programming: properties of the convex hull of feasible points”, MSRR No. 348 GSIA, Carnegie-Mellon University (July 1974).
E. Balas and R.G. Jeroslow, “Canonical cuts on the unit hypercube”,SIAM Journal on Applied Mathematics 23 (1972) 61–69.
E. Balas and E. Zemel, “Facets of the knapsack polytope from minimal covers”,SIAM Journal on Applied Mathematics 34 (1978) 119–148.
D.R. Fulkerson, “Blocking and antiblocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.
P.L. Hammer, E.L. Johnson and U.M. Peled, “Facets of regular 0–1 polytopes”,Mathematical Programming 8 (1975) 129–206.
G.L. Nemhauser and L.E. Trotter, Jr., “Properties of vertex packing and independence systems polyhedra”,Mathematical Programming 6 (1974) 48–61.
M. Padberg, “‘Simple’ zero–one problems: set covering, matching and coverings in graphs”, MSRR No. 235, Carnegie-Mellon University (January 1971).
M. Padberg, “On the facial structure of set packing polyhedra”,Mathematical Programming 5 (1973) 199–216.
M. Padberg, “A note on 0–1 programming”,Operations Research 23 (1975) 833–837.
M.A. Pollatschek, “Algorithms on finite weighed graphs”, Ph.D. Thesis, Technion-Israel Institute of Technology, Faculty of Industrial and Management Engineering (1970). [In Hebrew, with English Synopsis.]
J. Stoer and C. Witzgall,Convexity and optimization in finite dimension I (springer, New York, 1970).
L.E. Trotter, Jr., “A class of facet producing graphs for vertex packing polyhedra”,Discrete Mathematics, to appear.
L.E. Wolsey, “Faces of linear inequalities in 0–1 variables”,Mathematical Programming 8 (1975) 165–178.
L.E. Wolsey, “Facets and strong valid inequalities for integer programs”,Operations Research 24 (1976) 367–372.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zemel, E. Lifting the facets of zero–one polytopes. Mathematical Programming 15, 268–277 (1978). https://doi.org/10.1007/BF01609032
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01609032