We consider quadratic stochastic programs with random recourse - a class of problems which is perceived to be computationally demanding. Instead of using mainstream scenario tree-based techniques, we reduce computational complexity by restricting the space of recourse decisions to those linear and quadratic in the observations, thereby obtaining an upper bound on the original problem. To estimate the loss of accuracy of this approach, we further derive a lower bound by dualising the original problem and solving it in linear and quadratic recourse decisions. By employing robust optimisation techniques, we show that both bounding problems may be approximated by tractable conic programs. Finally, we illustrate the efficacy of the proposed approximation scheme in the context of a mean-variance portfolio optimisation problem.
Citation
Working paper, Department of Computing, Imperial College London, August 2011
Article
View A Polynomial-Time Solution Scheme for Quadratic Stochastic Programs