Accession Number : AD0742068

Title :   The Disjunctive Facet Problem: Formulation and Solution Techniques.

Descriptive Note : Research rept.,

Corporate Author : TEXAS UNIV AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s) : Glover,F. ; Klingman,D. ; Stutz,J.

Report Date : MAR 1972

Pagination or Media Count : 41

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 that 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 constrains to model these problems as mixed integer programs. The authors provide special cutting plances that are designed to take particular advantage of the disjunctive facet problem structure. Thus their 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. (Author)

Descriptors :   (*MATHEMATICAL PROGRAMMING, OPTIMIZATION), MATHEMATICAL MODELS, CONVEX SETS, THEOREMS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE