Disjunctive Programming.

Abstract

This paper reviews some recent developments in the convex analysis approach to integer programming. These developments are based on viewing integer programs as disjunctive programs. i.e., linear programs with disjunctive constraints, an approach which seems to be fruitful for 0-1 programming both theoretically and practically. On the theoretical side, it provides structural characterizations which offer new insights. On the practical side, it produces a variety of cutting planes with desirable properties and offers new ways of combining cutting planes with enumerative techniques. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1977
Accession Number
ADA059876

Entities

People

  • Egon Balas

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computer Programming
  • Convex Programming
  • Convex Sets
  • Equations
  • Evolutionary Algorithms
  • Inequalities
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Theorems
  • Trees (Data Structures)

Readers

  • Operations Research
  • Theoretical Analysis.