Analysis of stochastic dual dynamic programming method

Analysis of stochastic dual dynamic programming method

0.00 Avg rating0 Votes
Article ID: iaor20108322
Volume: 209
Issue: 1
Start Page Number: 63
End Page Number: 72
Publication Date: Feb 2011
Journal: European Journal of Operational Research
Authors:
Keywords: programming: dynamic
Abstract:

In this paper we discuss statistical properties and convergence of the Stochastic Dual Dynamic Programming (SDDP) method applied to multistage linear stochastic programming problems. We assume that the underline data process is stagewise independent and consider the framework where at first a random sample from the original (true) distribution is generated and consequently the SDDP algorithm is applied to the constructed Sample Average Approximation (SAA) problem. Then we proceed to analysis of the SDDP solutions of the SAA problem and their relations to solutions of the ‘true’ problem. Finally we discuss an extension of the SDDP method to a risk averse formulation of multistage stochastic programs. We argue that the computational complexity of the corresponding SDDP algorithm is almost the same as in the risk neutral case.

Reviews

Required fields are marked *. Your email address will not be published.