Lifting the Facets of 0-1 Polytopes.

Abstract

In this report the author discusses a procedure to obtain facets and valid inequalities for the convex hull of the set of solutions to a general 0-1 program. The procedure starts with a given facet (valid inequality) defined on a lower dimensional set of solutions and characterizes all the full dimensional facets (valid inequalities) which can be obtained by lifting it. The procedure subsumes the previous results concerning lifting lower dimensional facets (valid inequalities) for 0-1 programs and obtains many new facets (valid inequalities) unobtained by other methods.

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1974
Accession Number
ADA019445

Entities

People

  • Eitan Zemel

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Inequalities

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research