IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v35y1987i1p140-142.html
   My bibliography  Save this article

Technical Note—Recognizing Unbounded Integer Programs

Author

Listed:
  • 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)

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.

Suggested Citation

  • R. H. Byrd & A. J. Goldman & Miriam Heller, 1987. "Technical Note—Recognizing Unbounded Integer Programs," Operations Research, INFORMS, vol. 35(1), pages 140-142, February.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:1:p:140-142
    DOI: 10.1287/opre.35.1.140
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.1.140
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.1.140?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wiesława T. Obuchowska, 2015. "Irreducible Infeasible Sets in Convex Mixed-Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 747-766, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:35:y:1987:i:1:p:140-142. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.