Home > Research > Publications & Outputs > A heuristic for moment-matching scenario genera...
View graph of relations

A heuristic for moment-matching scenario generation

Research output: Contribution to journalJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>02/2003
<mark>Journal</mark>Computational Optimization and Applications
Issue number2-3
Volume24
Number of pages17
Pages (from-to)169-185
Publication StatusPublished
<mark>Original language</mark>English

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.