A Computer Code for Integer Solutions to Linear Programs

John Haldi and Leonard M. Isaacson
Additional contact information
John Haldi: Stanford University, Stanford, California
Leonard M. Isaacson: Standard Oil Company of California, San Francisco, California

Operations Research, 1965, vol. 13, issue 6, 946-959

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.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.6.946 (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:13:y:1965:i:6:p:946-959

Access Statistics for this article

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