On approximation in multistage stochastic programs: Markov dependence
Vlasta Kaňková, Martin Šmíd (2004)
Kybernetika
Similarity:
A general multistage stochastic programming problem can be introduced as a finite system of parametric (one-stage) optimization problems with an inner type of dependence. Evidently, this type of the problems is rather complicated and, consequently, it can be mostly solved only approximately. The aim of the paper is to suggest some approximation solution schemes. To this end a restriction to the Markov type of dependence is supposed.