We present a new algorithm for solving linear multistage stochastic programming problems with objective function coefficients modeled as a stochastic process. This algorithm overcomes the difficulties of existing methods which require discretization. Using an argument based on the finiteness of the set of possible cuts, we prove that the algorithm converges almost surely. Finally, we demonstrate the practical application of the algorithm on a hydro-bidding example with the spot-price modeled as an auto-regressive process.
Citation
University of Auckland, Level 3, 70 Symonds Street, Auckland, New Zealand. February/2018
Article
View Stochastic dual dynamic programming with stagewise dependent objective uncertainty