Technical Note—Recognizing Unbounded Integer Programs
Published in Operations Research • Feb 1, 1987
NobleIDNI9P33W78R01S59
Authors:,,
Richard H. Byrd
A. J. Goldman
Miriam Heller
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.
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!