Abstract
A necessary and sufficient condition is given for an inequality with coefficients 0 or 1 to define a facet of the knapsack polytope, i.e., of the convex hull of 0–1 points satisfying a given linear inequality. A sufficient condition is also established for a larger class of inequalities (with coefficients not restricted to 0 and 1) to define a facet for the same polytope, and a procedure is given for generating all facets in the above two classes. The procedure can be viewed as a way of generating cutting planes for 0–1 programs.
Similar content being viewed by others
References
E. Balas, “Facets of the knapsack polytope”, Management Science Research Rept. No. 323, Carnegie-Mellon University, Pittsburgh, Pa. (September 1973).
E. Balas, “Facets of the knapsack polytope”,Notices of the American Mathematical Society 21 (1974) A-11.
E. Balas and R. Jeroslow, “On the structure of the unit hypercube”, Management Science Research Rept. No. 198, Carnegie-Mellon University, Pittsburgh, Pa. (August–December 1969). Published as [5].
E. Balas and R. Jeroslow, “The hypercube and canonical cuts”,Notices of the American Mathematical Society 17 (1970) 450.
E. Balas and R. Jeroslow, “Canonical cuts on the unit hypercube”,SIAM Journal of Applied Mathematics 23 (1972) 61–69.
F. Glover, “Unit coefficient inequalities for zero–one programming”, Management Science Report Series No. 73-7, University of Colorado, Boulder, Colo. (July 1973).
F. Granot and P.L. Hammer, “On the use of Boolean functions in 0–1 programming”, Operations Research Mimeograph No. 70, Technion, Haifa (August 1970).
P.L. Hammer, E.L. Johnson and U.N. Peled, “Facets of regular 0–1 polytopes”, CORR 73-19, University of Waterloo, Waterloo, Ont. (October 1973).
G.L. Nemhauser and L.E. Trotter, Jr., “Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61.
M. Padberg, “On the facial structure of set packing polyhedra”,Mathematical Programming 5 (1973) 199–215.
M. Padberg, “A note on zero–one programming”,Operations Research, to appear.
L.A. Wolsey, “Faces of linear inequalities in 0–1 variables”, CORE Discussion Paper No. 7338, Université de Louvain, Louvain (November 1973).
Author information
Authors and Affiliations
Additional information
This paper was first circulated under [1]. A brief note on it was published under [2].
Rights and permissions
About this article
Cite this article
Balas, E. Facets of the knapsack polytope. Mathematical Programming 8, 146–164 (1975). https://doi.org/10.1007/BF01580440
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580440