Disjunctive Programming: Properties of the Convex Hull of Feasible Points.

Abstract

In this paper the author characterizes the convex hull of feasible points for a disjunctive program, a class of problems which subsumes pure and mixed integer programs and many other nonconvex programming problems. Two representations are given for the convex hull of feasible points, each of which provides linear programming equivalents of the disjunctive program. The first one involves a number of new variables proportional to the number of terms in the disjunctive normal form of the logical constraints; the second one involves only the original variables and the facets of the convex hull. Among other results, the author gives necessary and sufficient conditions for an inequality to define a facet of the convex hull of feasible points. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1974
Accession Number
AD0785177

Entities

People

  • Egon Balas

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Applied Mathematics
  • Computer Programming
  • Inequalities
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Nonconvex Programming
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Operations Research