Instructions for Using Experimental 0-1 Integer Linear Programming Code RIP23J.
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.