Abstract
The 0/1 knapsack equality polytope is, by definition, the convex hull of 0/1 solutions of a single linear equation. A special form of this polytope, where the defining linear equation has nonnegative integer coefficients and the number of variables having coefficient one exceeds the right-hand side, is considered. Equality constraints of this form arose in a real-world application of integer programming to a truck dispatching scheduling problem. Families of facet defining inequalities for this polytope are identified, and complete linear inequality representations are obtained for some classes of polytopes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BALAS, E., Facets of the Knapsack Polytope, Mathematical Programming, Vol. 8, pp. 146–164, 1975.
BALAS, E., and ZEMEL, E., Facets of the Knapsack Polytope from Minimal Covers, SIAM Journal on Applied Mathematics, Vol. 34, pp. 119–148, 1978.
HAMMER, P. L., JOHNSON, E. L., and PELED, U. N., Facets of Regular 0–1 Polytopes, Mathematical Programming, Vol. 8, pp. 179–206, 1975.
NEMHAUSER, G. L., and WOLSEY, L. A., Integer and Combinatorial Optimization, Wiley, New York, New York, 1988.
WOLSEY, L. A., Faces for a Linear Inequality in 0–1 Variables, Mathematical Programming, Vol. 8, pp. 165–178, 1975.
ZEMEL, E., Easily Computable Facets of the Knapsack Polytope, Mathematics of Operations Research, Vol. 14, pp. 760–764, 1989.
BIXBY, R. E., and LEE, E. K., Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut, 1994, Operations Research (to appear).
LEE, E. K., Solving Structured 0/1 Integer Programming Problems Arising from Truck Dispatching Scheduling Problems, PhD Thesis, Rice University, 1993.
LEE, E. K., Facets of Special Knapsack Equality Polytopes, Report 38, Computational and Applied Mathematics, Rice University, 1993.
HAMMER, P. L., and PELED, U. N., Computing Low-Capacity 0–1 Knapsack Polytopes, Zeitschrift für Operations Research, Vol. 26, pp. 243–249, 1982.
PELED, U. N., Properties of Facets of Binary Polytopes, Annals of Discrete Mathematics, Vol. 1, pp. 435–456, 1977.
WEISMANTEL, R., On the 0/1 Knapsack Polytope, Research Report 1, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, Germany, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lee, E.K. On Facets of Knapsack Equality Polytopes. Journal of Optimization Theory and Applications 94, 223–239 (1997). https://doi.org/10.1023/A:1022624122832
Issue Date:
DOI: https://doi.org/10.1023/A:1022624122832