Optimisation of Stochastic Programming by Hidden Markov Modelling based Scenario Generation

Sovan Mitra

Papers from arXiv.org

Abstract: This paper formed part of a preliminary research report for a risk consultancy and academic research. Stochastic Programming models provide a powerful paradigm for decision making under uncertainty. In these models the uncertainties are represented by a discrete scenario tree and the quality of the solutions obtained is governed by the quality of the scenarios generated. We propose a new technique to generate scenarios based on Gaussian Mixture Hidden Markov Modelling. We show that our approach explicitly captures important time varying dynamics of stochastic processes (such as autoregression and jumps) as well as non-Gaussian distribution characteristics (such as skewness and kurtosis). Our scenario generation method enables richer robustness and scenario analysis through exploiting the tractable properties of Markov models and Gaussian mixture distributions. We demonstrate the benefits of our scenario generation method by conducting numerical experiments on FTSE-100 data.

Date: 2009-04
New Economics Papers: this item is included in nep-ets and nep-ore
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/0904.1131 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:0904.1131

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().