Stochastic programs over trees with random arc capacities

@article{Powell1994StochasticPO,
  title={Stochastic programs over trees with random arc capacities},
  author={Warren B. Powell and Raymond K.-M. Cheung},
  journal={Networks},
  year={1994},
  volume={24},
  pages={161-175}
}
In this paper, we study a special class of stochastic programs where the recourse problem consists of trees with random arc capacities, which we call tree recourse. We develop an efficient procedure to obtain the expected recourse function exactly for single-stage problems. This procedure is used in a backward recursion to find the exact expected recourse function for multistage trees. We show that for large trees n-stage networks can be solved more easily than can a single-stage network with n… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Wets , Scenarios and policy aggregation in optimization under uncertainty

R. M. Van Slyke, R. J.-B.
Math . OperationsRes . • 1991

Bounding the expected timecost curve for a stochastic PERT network from below

T. W.
Operations Res . Lett . • 1989

An alternating method for stochastic linear programming with simple recourse

R. J.-B.
1988

Development and evaluation of a successive linear approximation procedure for stochastic . dynamic networks

W. B. Powell
1988

Nonlinear programming techniques. Niimerical Techniques for Stochastic Optimization

J. L. Nazareth, R.J.-B. Wets
1988

Similar Papers

Loading similar papers…