Tree approximations of dynamic stochastic programs. (English) Zbl 1211.90150

Summary: We consider a tree-based discretization technique utilizing conditional transportation distance, which is well suited for the approximation of multistage stochastic programming problems, and investigate corresponding convergence properties. We explain the relation between the approximation quality of the probability model and the quality of the solution.


90C15 Stochastic programming
Full Text: DOI