A Polynomial-Time Solution Scheme for Quadratic Stochastic Programs
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 dualizing the original problem and solving it in linear and quadratic recourse decisions. By employing robust optimization techniques, we show that both bounding problems may be approximated by tractable conic programs.
KeywordsDecision rule approximation Robust optimization Quadratic stochastic programming Conic programming
We thank Fundação para a Ciência e a Tecnologia and EPSRC (under grant EP/H0204554/1) for financial support. We are grateful to the referees and the editor for their helpful suggestions for improving the manuscript.
- 8.Georghiou, A., Wiesemann, W., Kuhn, D.: Generalized decision rule approximations for stochastic programming via liftings (2010). Available on Optimization Online, submitted for publication Google Scholar
- 14.Wiesemann, W., Kuhn, D., Rustem, B.: Robust Markov decision processes. Math. Oper. Res. (Forthcoming) Google Scholar
- 19.Rocha, P.: Medium-term planning in deregulated energy markets with decision rules. Ph.D. thesis, Imperial College, London (2012) Google Scholar