The Disjunctive-Facet Problem: Formulation and Solution Techniques

F. Glover, D. Klingman and J. Stutz
Additional contact information
F. Glover: University of Colorado, Boulder, Colorado
D. Klingman: The University of Texas, Austin, Texas
J. Stutz: The University of Texas, Austin, Texas

Operations Research, 1974, vol. 22, issue 3, 582-601

Abstract: Many practical operations-research problems have the form in which the objective is to select an optimal production schedule, rental policy, distribution pattern, etc., from among a variety of alternatives, each of which has an associated set of constraints that must all be satisfied if a particular alternative is chosen. The disjunctive-facet problem provides a “direct” formulation for such problems, circumventing the need to resort to artifices involving the creation of discrete variables and supporting constraints to model these problems as mixed integer programs. We provide special cutting planes that are designed to take particular advantage of the disjunctive-facet problem structure. Thus, our results not only give a more compact representation of certain classes of discrete optimization problems, but provide more powerful methods for solving these problems as well.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.3.582 (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:22:y:1974:i:3:p:582-601

Access Statistics for this article

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