Instructions for Using Experimental 0-1 Integer Linear Programming Code RIP23J.

by A. M. Geoffrion, Alfred B. Nelson


Purchase Print Copy

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

Presents the experimental code used to obtain the computational experience reported in two recent RAND publications on linear programming. The code 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 rather than how to achieve the least possible execution time for particular problems. Therefore, the simplest possible Balasian algorithm was used as a starting point, and concessions were freely made to programming expediency. The program solves integer linear programs in which it is desired to minimize [cx] subject to: [b] plus [Ax] is greater than or equal to 0 where each component of [x] is 0 or 1. Here [c] and [x] are [n]-vectors, [b] is an [m]-vector, and [A] is [m] by [n]. (See also RM-5406.) 31 pp. Ref.

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

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.