Inequalities for Stochastic Linear Programming Problems

Abstract

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 261 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.