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.
No takes yet. Share an insight, caveat, or question.
Mirkov et al. (2007) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: