Shapiro, A. (2013) Sample Average Approximation. In: Gass, S.I. and Fu, M.C., Eds., Encyclopedia of Operations Research and Management Science, Springer, Boston, MA, 1350-1355.
https://doi.org/10.1007/978-1-4419-1153-7_1154

has been cited by the following article:

• TITLE: Experimental Study of Methods of Scenario Lattice Construction for Stochastic Dual Dynamic Programming

  AUTHORS: Dmitry Golembiovsky, Anton Pavlov, Smetanin Daniil

  KEYWORDS: Stochastic Dual Dynamic Programming, Newsvendor Problem, Markov Process

  JOURNAL NAME: Open Journal of Optimization, Vol.10 No.2, June 28, 2021

  ABSTRACT: The stochastic dual dynamic programming (SDDP) algorithm is becoming increasingly used. In this paper we present analysis of different methods of lattice construction for SDDP exemplifying a realistic variant of the newsvendor problem, incorporating storage of production. We model several days of work and compare the profits realized using different methods of the lattice construction and the corresponding computer time spent in lattice construction. Our case differs from the known one because we consider not only a multidimensional but also a multistage case with stage dependence. We construct scenario lattice for different Markov processes which play a crucial role in stochastic modeling. The novelty of our work is comparing different methods of scenario lattice construction. We considered a realistic variant of the newsvendor problem. The results presented in this article show that the Voronoi method slightly outperforms others, but the k-means method is much faster overall.