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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
