Inequalities for Stochastic Linear Programming Problems
Consider a linear-programming problem in which the "right-hand side" is a random vector whose expected value is known and where the expected value of the objective function is to be minimized. An approximate solution is often found by replacing the "right-hand side" by its expected value and solving the resulting linear programming problem. In this paper conditions are given for the equality of the expected value of the objective function for the optimal solution and the value of the objective function for the approximate solution; bounds on these values are also given. In addition, the relation between this problem and a related problem, where one makes an observation on the "right-hand side" and solves the (nonstochastic) linear programming problem based on this observation, is discussed.
Year of publication: |
1960
|
---|---|
Authors: | Madansky, Albert |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 6.1960, 2, p. 197-204
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Prescriptions for working statisticians
Madansky, Albert, (1988)
-
The fitting of straight lines when both variables are subject to error
Madansky, Albert, (1959)
-
Inequalities for stochastic linear programming problems
Madansky, Albert, (1960)
- More ...