A discussion of the process of finding a feasible solution of a linear programming problem by means of the simplex method. It is shown how certain rules regarding the details of the process result in the "composite" algorithm, a procedure used in several linear-programming computer routines. Experimental evidence for the efficiency of the procedure is given. 47 pp
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.