Optimisation of stochastic programming by hidden Markov modelling based scenario generation Online publication date: Wed, 02-Jun-2010
by Sovan Mitra, Tong Ji
International Journal of Mathematics in Operational Research (IJMOR), Vol. 2, No. 4, 2010
Abstract: 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 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 Gaussian mixture distributions. We provide the computational implementation of our scenario generation method, which includes calibration. We demonstrate the benefits of our scenario generation method by conducting numerical experiments on the FTSE-100 index.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook