A discussion of the uncertainty involved in most linear-programming problems in either the technology matrix, the right-hand side, or the cost. Two methods of reducing the effects of uncertainty are to replace the random elements by their expected values (the "expected-value solution"), and to replace the random elements by pessimistic estimates of their values (the "fat" technique). This paper examines the use of these methods in the one-stage stochastic linear program and describes the relation between the one- and two-stage problem. The relation between the "fat" techniques used in the one-stage problem and the so-called "slack" techniques used in the two-stage problem is then determined.
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.
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.
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.