On the status of multistage linear programming problems.
ResearchPublished 1957
ResearchPublished 1957
A survey of the kinds of structures encountered and the methods proposed for solving multistage linear programming problems. The single and multicommodity warehouse problem is used to illustrate some basic ideas. In addition, the study discusses the possibility of solving a dynamic problem from a steady-state problem, the need for solving large-scale systems, and the methods for solving block triangular systems.
This publication is part of the RAND paper series. The paper series was a product of RAND 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.
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.