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

A Computer Code for Integer Solutions to Linear Programs

Author

Listed:
  • John Haldi

    (Stanford University, Stanford, California)

  • Leonard M. Isaacson

    (Standard Oil Company of California, San Francisco, California)

Abstract

This paper reports on a new computer code (called “LIP1”) for solving integer programming problems, which will be distributed for general use through SHARE. LIP1 was written as an experimental program for the purpose of reexamining and further testing the efficiency of Gomory's original cutting-plane technique. Many trial problems have now been solved with this code. Of particular interest, however, are 25 test problems that have been solved with other integer programming codes (all these other codes incorporate the method of Gomory's more recent all-integer algorithm). The basis for comparing the performance of the various codes is the number of iterations required to solve each problem. For these 25 test problems LIP1 appears generally as efficient as the other codes tested. Moreover, on the more difficult problems LIP1 generally performed better than the other codes. We conclude that Gomory's original cutting-plane method merits further investigation and development as an efficient computational technique.

Suggested Citation

  • John Haldi & Leonard M. Isaacson, 1965. "A Computer Code for Integer Solutions to Linear Programs," Operations Research, INFORMS, vol. 13(6), pages 946-959, December.
    • Handle: RePEc:inm:oropre:v:13:y:1965:i:6:p:946-959
    DOI: 10.1287/opre.13.6.946
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.13.6.946
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.13.6.946?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. Robert M. Saltzman & Frederick S. Hillier, 1991. "An exact ceiling point algorithm for general integer linear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 53-69, February.

    More about this item

    Statistics

    Access and download statistics

    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:13:y:1965:i:6:p:946-959. 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.