Conditioning of convex piecewise linear stochastic programs

Abstract. In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal solution of such a problem we associate a condition number which characterizes well or ill conditioning of the problem. Using theory of Large Deviations we show that the sample size needed to calculate the optimal solution of such problem with a given probability is approximately proportional to the condition number.

[1]  M. Stein.  Large sample properties of simulations using latin hypercube sampling , 1987 .

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

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

[4]  Charles Leake,et al.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1994 .

[5]  John R. Birge,et al.  An upper bound on the network recourse function Christopher J. Donohue and John R. Birge. , 1995 .

[6]  Jason H. Goodfriend,et al.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1995 .

[7]  Roger J.-B. Wets,et al.  Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems , 1995, Ann. Oper. Res..

[8]  James Renegar,et al.  Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method , 1996, SIAM J. Optim..

[9]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[10]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[11]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[12]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[13]  P. A. Jensen,et al.  Response surface analysis of two‐stage stochastic linear programming with recourse , 1999 .

[14]  Robert M. Freund,et al.  Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system , 1999, Math. Program..

[15]  Chun-Hung Chen,et al.  Convergence Properties of Two-Stage Stochastic Programming , 2000 .

[16]  Alexander Shapiro,et al.  Stochastic programming by Monte Carlo simulation methods , 2000 .

[17]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[18]  Alexander Shapiro,et al.  On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..

[19]  Tito Homem-de-Mello,et al.  Monte Carlo Methods for Discrete Stochastic Optimization , 2001 .

[20]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..