Primal and dual linear decision rules in stochastic and robust optimization
Linear stochastic programming provides a flexible toolbox for analyzing real-life decision situations, but it can become computationally cumbersome when recourse decisions are involved. The latter are usually modeled as decision rules, i.e., functions of the uncertain problem data. It has recently been argued that stochastic programs can quite generally be made tractable by restricting the space of decision rules to those that exhibit a linear data dependence. In this paper, we propose an efficient method to estimate the approximation error introduced by this rather drastic means of complexity reduction: we apply the linear decision rule restriction not only to the primal but also to a dual version of the stochastic program. By employing techniques that are commonly used in modern robust optimization, we show that both arising approximate problems are equivalent to tractable linear or semidefinite programs of moderate sizes. The gap between their optimal values estimates the loss of optimality incurred by the linear decision rule approximation. Our method remains applicable if the stochastic program has random recourse and multiple decision stages. It also extends to cases involving ambiguous probability distributions.
KeywordsLinear decision rules Stochastic optimization Robust optimization Error bounds Semidefinite programming
Mathematics Subject Classification (2000)90C15 (Stochastic Programming)
Unable to display preview. Download preview PDF.
- 1.Ang, M., Chou, M., Sim, M., So, K.: A robust optimization framework for analyzing distribution systems with transshipments. Working paper. National University of Singapore, Singapore (2008)Google Scholar
- 8.Bertsekas D.: Dynamic Programming and Optimal Control, Volumes I and II. Athena Scientific, Belmont, MA (2001)Google Scholar
- 11.Boyd S., El Ghaoui L., Feron E., Balakrishnan V.: Linear Matrix Inequalities in System and Control Theory, vol. 15 of SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994)Google Scholar
- 15.Chen, X., Zhang, Y.: Uncertain linear programs: extended affinely adjustable robust counterparts. Oper. Res. (2009), opre.1080.0605Google Scholar
- 19.Klein Haneveld W.: Duality in Stochastic linear and dynamic programming, vol. 274 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (1985)Google Scholar
- 22.Rockafellar R., Uryasev S.: Optimization of conditional value-at-risk. J. Risk 2(3), 21–41 (2000)Google Scholar
- 23.Rockafellar R., Wets R.-B.: Variational Analysis, vol. 317 of A Series of Comprehensive Studies in Mathematics. Springer-Verlag, New York (1998)Google Scholar
- 24.Shapiro, A.: On duality theory of conic linear problems. In Semi-Infinite Programming. Kluwer Academic Publishers, pp. 135–165 (2001)Google Scholar
- 26.Shapiro A., Nemirovski A.: On complexity of stochastic programming problems. In: Jeyakumar, V., Rubinov, A. (eds) Continuous Optimization: Current Trends and Applications, pp. 111–144. Springer, Berlin (2005)Google Scholar