User's Instructions for 0-1 Integer Linear Programming Code RIP30C

by A. M. Geoffrion, Alfred B. Nelson


Download eBook for Free

FormatFile SizeNotes
PDF file 1 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback34 pages $20.00 $16.00 20% Web Discount

A description and listing of the experimental code used to obtain the computational experience reported in RM-5644-PR. Although RIP30C is not a production code, it has proven capable of solving zero-one integer linear programs of practical size quickly enough to make it among the fastest, if not the fastest, code of its kind in existence at present. It was developed to test the usefulness of certain innovations applied to a simple Balasian algorithm. The main concern was the rate of increase of solution time as a function of the number of variables, rather than how to achieve the smallest possible execution time for particular problems. Concessions to programming expediency were freely made. The program was written entirely in FORTRAN IV for RAND's 32,000-word machine. It is dimensioned to handle problems with up to 90 variables and 50 constraints. Results show that the use of the imbedded linear program dramatically reduces solution times in virtually every case (in the 35-variable range, it reduced solution times by a factor of about 100).

This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.