The Simplex Method Using Pseudo-Basic Variables for Structured Linear Programming Problems

by E. M. L. Beale

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback32 pages $15.00 $12.00 20% Web Discount

A procedure for solving linear programming problems that consist of separate subproblems with a few linking variables that occur in all (or several) subproblems. This is the simplex method, organized so that the advantages of the special structure of the problem are preserved.

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.