A Note on the Asymptotic Theory of Integer Programming and the 0-1 Case.

Abstract

While asymptotic theory is in many ways useful for 0-1 problems too, in this note the author shows that in the case of a 0-1 program the sufficient condition given by Gomory for a solution to the asymptotic problem to solve the initial integer program, is never satisfied. A much weaker (and less than sufficient) condition is also never satisfied. This underscores the need to use information about the constraints that are slack at the linear programming optimum. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1971
Accession Number
AD0724792

Entities

People

  • Egon Balas

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research