On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint

David S. Rubin
Additional contact information
David S. Rubin: University of Chicago, Chicago, Illinois

Operations Research, 1970, vol. 18, issue 5, 940-946

Abstract: The convex hull of the feasible integer points to a given integer program is a convex polytope I . The feasible set obtained by relaxing the integrality requirements is another convex polytope L . Cutting-plane algorithms essentially try to remove part of L − I . Hence the more complicated the relationship between L and I , the more difficult (in some sense) the integer program. This paper shows one such complexity: specifically, we construct a series of programs such that I has arbitrarily many faces even though L is a triangle. We also indicate the existence of a large class of problems that exhibit the same behavior.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.5.940 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:5:p:940-946

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().