Free Access

Technical Note—Recognizing Unbounded Integer Programs

R. H. Byrd
R. H. Byrd
University of Colorado, Boulder, Colorado
Search for more papers by this author
,
A. J. Goldman
A. J. Goldman
The Johns Hopkins University, Baltimore, Maryland
Search for more papers by this author
,
Miriam Heller
Miriam Heller
Applications Statistiques Scientifiques Informatiques S A., Suresnes, France
Search for more papers by this author

R. H. Byrd

University of Colorado, Boulder, Colorado

Search for more papers by this author

A. J. Goldman

The Johns Hopkins University, Baltimore, Maryland

Search for more papers by this author

Miriam Heller

Applications Statistiques Scientifiques Informatiques S A., Suresnes, France

Search for more papers by this author

Published Online:1 Feb 1987https://doi.org/10.1287/opre.35.1.140

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.

Volume 35, Issue 1

January-February 1987

Pages 2-163

Article Information

Metrics

Information

Published Online:February 01, 1987

Cite as

R. H. Byrd, A. J. Goldman, Miriam Heller, (1987) Technical Note—Recognizing Unbounded Integer Programs. Operations Research 35(1):140-142.

https://doi.org/10.1287/opre.35.1.140

Keywords

639 inferring integer program unboundedness from continuous relaxation

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Technical Note—Recognizing Unbounded Integer Programs

Abstract

Volume 35, Issue 1

Article Information

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News