Analyzing the quality of the expected value solution in stochastic programming

Stochastic programs are usually hard to solve when applied to real-world problems; a common approach is to consider the simpler deterministic program in which random parameters are replaced by their expected values, with a loss in terms of quality of the solution. The Value of the Stochastic Solution—VSS—is normally used to measure the importance of using a stochastic model. But what if VSS is large, or expected to be large, but we cannot solve the relevant stochastic program? Shall we just give up? In this paper we investigate very simple methods for studying structural similarities and differences between the stochastic solution and its deterministic counterpart. The aim of the methods is to find out, even when VSS is large, if the deterministic solution carries useful information for the stochastic case. It turns out that a large VSS does not necessarily imply that the deterministic solution is useless for the stochastic setting. Measures of the structure and upgradeability of the deterministic solution such as the loss using the skeleton solution and the loss of upgrading the deterministic solution will be introduced and basic inequalities in relation to the standard VSS are presented and tested on different cases.

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

[2]  John R. Birge,et al.  The value of the stochastic solution in stochastic linear programs with fixed recourse , 1982, Math. Program..

[3]  Teodor Gabriel Crainic,et al.  Single source single-commodity stochastic network design , 2011, Computational Management Science.

[4]  J Figueira,et al.  Stochastic Programming , 1998, J. Oper. Res. Soc..

[5]  Elisabetta Allevi,et al.  Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks , 2009 .

[6]  Michal Kaut,et al.  Stochastic optimization models for a single-sink transportation problem , 2009, Comput. Manag. Sci..

[7]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[8]  K. A. Ariyawansa,et al.  A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs , 2011 .

[9]  Peter Kall,et al.  Stochastic Programming , 1995 .

[10]  Julia L. Higle,et al.  Sensitivity Analysis and Uncertainty in Linear Programming , 2003, Interfaces.

[11]  Marida Bertocchi,et al.  Sensitivity Analysis in Stochastic Second Order Cone Programming for Mobile Ad Hoc Networks , 2010 .

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

[13]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[14]  Stein W. Wallace,et al.  Decision Making Under Uncertainty: Is Sensitivity Analysis of Any Use? , 2000, Oper. Res..

[15]  L. L. Garver,et al.  Power Generation Scheduling by Integer Programming-Development of Theory , 1962, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.

[16]  Len Cook 2010 under Review , 2010 .