Analysis of stochastic dual dynamic programming method

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.

[1]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[2]  John R. Birge,et al.  The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse , 2006, Algorithmic Oper. Res..

[3]  Andrzej Ruszczynski,et al.  Risk-averse dynamic programming for Markov decision processes , 2010, Math. Program..

[4]  Alexander Shapiro,et al.  On Complexity of Stochastic Programming Problems , 2005 .

[5]  Marius Sinclair.  Applied mathematical programming and modelling , 1995 .

[6]  R. Rockafellar,et al.  Optimization of conditional value-at risk , 2000 .

[7]  Andrew B. Philpott,et al.  On the convergence of stochastic dual dynamic programming and related methods , 2008, Oper. Res. Lett..

[8]  Warrren B Powell,et al.  Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse , 1999 .

[9]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[10]  Alexander Shapiro,et al.  Conditional Risk Mappings , 2005, Math. Oper. Res..

[11]  Alexander Shapiro,et al.  Optimization of Convex Risk Functions , 2006, Math. Oper. Res..

[12]  T. Ralphs,et al.  Decomposition Methods , 2010 .

[13]  A. Winsor.  Sampling techniques. , 2000, Nursing times.

[14]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[15]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[16]  M. V. F. Pereira,et al.  Multi-stage stochastic optimization applied to energy planning , 1991, Math. Program..

[17]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[18]  Andy Philpott,et al.  On the Convergence of Sampling-Based Decomposition Algorithms for Multistage Stochastic Programs , 2005 .

[19]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[20]  Alexander Shapiro,et al.  On complexity of multistage stochastic programs , 2006, Oper. Res. Lett..

[21]  Philippe Artzner,et al.  Coherent Measures of Risk , 1999 .

[22]  M. Pereira.  Optimal stochastic operations scheduling of large hydroelectric systems , 1989 .

[23]  Alexander Shapiro,et al.  On a time consistency concept in risk averse multistage stochastic programming , 2009, Oper. Res. Lett..