Optimisation of stochastic programming by hidden Markov modelling based scenario generation

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.