Applied Optimization Volume 99, 2005, pp 111-146

On Complexity of Stochastic Programming Problems

* Final gross prices may vary according to local VAT.

Get Access

Summary

The main focus of this paper is in a discussion of complexity of stochastic programming problems. We argue that two-stage (linear) stochastic programming problems with recourse can be solved with a reasonable accuracy by using Monte Carlo sampling techniques, while multistage stochastic programs, in general, are intractable. We also discuss complexity of chance constrained problems and multistage stochastic programs with linear decision rules.