A Heuristic for Moment-Matching Scenario Generation |
| |
Authors: | Kjetil Høyland Michal Kaut Stein W Wallace |
| |
Institution: | (1) Gjensidige Nor Asset Management, P.O. Box 276, N-1326 Lysaker, Norway;(2) Department of Industrial Economics and Technology Management, NTNU, N-7491 Trondheim, Norway;(3) Molde University College, Servicebox 8, N-6405 Molde, Norway |
| |
Abstract: | In stochastic programming models we always face the problem of how to represent the random variables. This is particularly difficult with multidimensional distributions. We present an algorithm that produces a discrete joint distribution consistent with specified values of the first four marginal moments and correlations. The joint distribution is constructed by decomposing the multivariate problem into univariate ones, and using an iterative procedure that combines simulation, Cholesky decomposition and various transformations to achieve the correct correlations without changing the marginal moments.With the algorithm, we can generate 1000 one-period scenarios for 12 random variables in 16 seconds, and for 20 random variables in 48 seconds, on a Pentium III machine. |
| |
Keywords: | stochastic programming scenario tree generation Cholesky decomposition heuristics |
本文献已被 SpringerLink 等数据库收录! |
|