Technical Note—Recognizing Unbounded Integer Programs

R. H. Byrd, A. J. Goldman and Miriam Heller
Additional contact information
R. H. Byrd: University of Colorado, Boulder, Colorado
A. J. Goldman: The Johns Hopkins University, Baltimore, Maryland
Miriam Heller: Applications Statistiques Scientifiques Informatiques S A., Suresnes, France

Operations Research, 1987, vol. 35, issue 1, 140-142

Abstract: If an integer program (IP) has an unbounded continuous relaxation, is the IP also unbounded? We find the answer to be “no” in general but “yes” when the IP is feasible and has rational data. We also discuss related geometrical and algorithmic considerations.

Keywords: 639; inferring; integer; program; unboundedness; from; continuous; relaxation (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.1.140 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:1:p:140-142

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().