Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs

Planning under uncertainty requires the explicit representation of uncertain quantities within an underlying decision model. When the underlying model is a linear program, the representation of certain data elements as random variables results in a stochastic linear program (SLP). Precise evaluation of an SLP objective function requires the solution of a large number of linear programs, one for each possible combination of the random variables' outcomes. To reduce the effort required to evaluate the objective function, approximations, especially those derived from randomly sampled data, are often used. In this article, we explore a variety of variance-reduction techniques that can be used to improve the quality of the objective-function approximations derived from sampled data. These techniques are presented within the context of SLP objective-function evaluations. Computational results offering an empirical comparison of the level of variance reduction afforded by the various methods are included.

[1]  John M. Mulvey,et al.  A New Scenario Decomposition Method for Large-Scale Stochastic Optimization , 1995, Oper. Res..

[2]  Dag Haugland,et al.  Solving many linear programs that differ only in the righthand side , 1988 .

[3]  David P. Rutenberg,et al.  Computation in Discrete Stochastic Programs with Recourse , 1973, Oper. Res..

[4]  R. Wets Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program , 1974 .

[5]  Andrzej Ruszczyński,et al.  Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results , 1993 .

[6]  Julia L. Higle,et al.  Finite master programs in regularized stochastic decomposition , 1994, Math. Program..

[7]  Yuri Ermoliev,et al.  Numerical techniques for stochastic optimization , 1988 .

[8]  George B. Dantzig,et al.  Parallel processors for planning under uncertainty , 1990 .

[9]  Julia L. Higle,et al.  Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming , 1996 .

[10]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[11]  Sigrún Andradóttir,et al.  On the Choice of Alternative Measures in Importance Sampling with Markov Chains , 1995, Oper. Res..

[12]  Karl Frauendorfer,et al.  Stochastic Two-Stage Programming , 1992 .

[13]  Paul Bratley,et al.  A guide to simulation (2nd ed.) , 1986 .

[14]  Andrzej Ruszczynski,et al.  A Linearization Method for Nonsmooth Stochastic Programming Problems , 1987, Math. Oper. Res..

[15]  Y. Smeers,et al.  Optimal Investments for Electricity Generation: A Stochastic Model and a Test-Problem , 1988 .

[16]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[17]  Alexander Shapiro,et al.  A simulation-based approach to two-stage stochastic programming with recourse , 1998, Math. Program..

[18]  Gerd Infanger,et al.  Monte Carlo (importance) sampling within a benders decomposition algorithm for stochastic linear programs , 1991, Ann. Oper. Res..