A Linear Decision-Based Approximation Approach to Stochastic Programming

Stochastic optimization, especially multistage models, is well known to be computationally excruciating. Moreover, such models require exact specifications of the probability distributions of the underlying uncertainties, which are often unavailable. In this paper, we propose tractable methods of addressing a general class of multistage stochastic optimization problems, which assume only limited information of the distributions of the underlying uncertainties, such as known mean, support, and covariance. One basic idea of our methods is to approximate the recourse decisions via decision rules. We first examine linear decision rules in detail and show that even for problems with complete recourse, linear decision rules can be inadequate and even lead to infeasible instances. Hence, we propose several new decision rules that improve upon linear decision rules, while keeping the approximate models computationally tractable. Specifically, our approximate models are in the forms of the so-called second-order cone (SOC) programs, which could be solved efficiently both in theory and in practice. We also present computational evidence indicating that our approach is a viable alternative, and possibly advantageous, to existing stochastic optimization solution techniques in solving a two-stage stochastic optimization problem with complete recourse.

[1]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[2]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[3]  Martin E. Dyer,et al.  Computational complexity of stochastic programming problems , 2006, Math. Program..

[4]  Melvyn Sim,et al.  Robust Discrete Optimization , 2003 .

[5]  Garud Iyengar,et al.  On two-stage convex chance constrained problems , 2007, Math. Methods Oper. Res..

[6]  L El Ghaoui,et al.  ROBUST SOLUTIONS TO LEAST-SQUARE PROBLEMS TO UNCERTAIN DATA MATRICES , 1997 .

[7]  Vaithilingam Jeyakumar,et al.  Continuous optimization : current trends and modern applications , 2005 .

[8]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[9]  Xiang Li,et al.  Probabilistically Constrained Linear Programs and Risk-Adjusted Controller Design , 2005, SIAM J. Optim..

[10]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[11]  Donald Goldfarb,et al.  Robust convex quadratically constrained programs , 2003, Math. Program..

[12]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[13]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

[14]  Giuseppe Carlo Calafiore,et al.  The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.

[15]  E. Beale ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[16]  Garud Iyengar,et al.  Ambiguous chance constrained problems and robust optimization , 2006, Math. Program..

[17]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[18]  Melvyn Sim,et al.  A Robust Optimization Framework for Analyzing Distribution Systems with Transshipment , 2008 .

[19]  R. Henrion Structural properties of linear probabilistic constraints , 2007 .

[20]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[21]  Boaz Golany,et al.  Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach , 2005, Manuf. Serv. Oper. Manag..

[22]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[23]  Boaz Golany,et al.  Supplier-Retailer Flexible Commitments Contracts : A Robust Optimization Approach , 2003 .

[24]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[25]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[26]  Melvyn Sim,et al.  Tractable Approximations to Robust Conic Optimization Problems , 2006, Math. Program..

[27]  Peng Sun,et al.  A Robust Optimization Perspective on Stochastic Programming , 2007, Oper. Res..

[28]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[29]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[30]  Melvyn Sim,et al.  Robust Discrete Optimization and Downside Risk Measures , 2006 .

[31]  Marco C. Campi,et al.  Decision Making in an Uncertain Environment: the Scenario based Optimization Approach , 2004 .

[32]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[33]  A Ben Tal,et al.  ROBUST SOLUTIONS TO UNCERTAIN PROGRAMS , 1999 .

[34]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[35]  S. Vaida,et al.  Studies in the Mathematical Theory of Inventory and Production , 1958 .

[36]  Alexander Shapiro,et al.  On Complexity of Stochastic Programming Problems , 2005 .