Improving the performance of Stochastic Dual Dynamic Programming

Citations of this article
Mendeley users who have this article in their library.


This paper is concerned with tuning the Stochastic Dual Dynamic Programming algorithm to make it more computationally efficient. We report the results of some computational experiments on a large-scale hydrothermal scheduling model developed for Brazil. We find that the best improvements in computation time are obtained from an implementation that increases the number of scenarios in the forward pass with each iteration and selects cuts to be included in the stage problems in each iteration. This gives an order of magnitude decrease in computation time with little change in solution quality.




De Matos, V. L., Philpott, A. B., & Finardi, E. C. (2015). Improving the performance of Stochastic Dual Dynamic Programming. Journal of Computational and Applied Mathematics, 290, 196–208.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free