Notes on Linear Programming — Part XII

A Composite Simplex Algorithm — II

by W. Orchard-Hays

Purchase Print Copy

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

A proposal which combines the normal and dual algorithms, with some modifications, in order to determine an optimal solution in fewer iterations than by other methods. The present study separates the nonsingularity of a basis matrix and the feasibility and the optimality of the solution.

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.