The Composite Simplex Algorithm: Notes on Linear Programming and Extensions--Part 64.
ResearchPublished 1963
ResearchPublished 1963
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 publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND 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.