Inequalities for Stochastic Linear Programming Problems

Author

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.

More about this item

Statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:6:y:1960:i:2:p:197-204. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through
the various RePEc services.