Abstract
Two-stage models are frequently used when making decisions under the influence of randomness. The case of normally distributed right hand side vector – with independent or correlated components – is treated here. The expected recourse function is computed by an enhanced Monte Carlo integration technique. Successive regression approximation technique is used for computing the optimal solution of the problem. Computational issues of the algorithm are discussed, improvements are proposed and numerical results are presented for random right hand side and a random matrix in the second stage problems.
Similar content being viewed by others
References
Birge, J. and F. Louveaux. (1997). Introduction to Stochastic Programming. Springer, p. 421.
Box, G.E.P. and N.R. Draper. (1987). Empirical Model-Building and Response Surface. J. Wiley and Sons.
Deák, I. (1990). “Random Number Generators and Simulation.” In A. Prékopa (ed.), Mathematical Methods of OR. Akadémiai Kiadø (Publishing House of the Hungarian Academy of Sciences), Budapest, p. 342.
Deák, I. (1998). “Linear Regression Estimators for Multinormal Distributions in Optimization of Stochastic Programming Models.” European J. Operational Research 111, 555–568.
Deák, I. (2001). “Subroutines for Computing Normal Probabilities of Sets—Computer Experiences.” Ann. Operations Research 100, 103–122.
Deák, I. (2001). “Computer Experiences with Successive Regression Approximations for Solving Equations, Optimization Theory.” In F. Gianessi, P. Pardalos, and T. Rapcsák, (eds.), Kluwer Academic Publishers, Dordrecht-Boston-London, 65–80.
Deák, I. (2001). “Successive Regression Approximations for Solving Equations”. Pure Mathematics and Applications 12, 25–50.
Deák, I. (2003). “Probabilities of Simple N-Dimensional Sets in Case of Normal Distribution.” IIE Trans. on Operations Engineering, V 35., 285–293.
Deák, I. (2002). “Computing Two-Stage Stochastic Programming Problems By Successive Regression Approximations.” In K. Marti (ed.), Stochastic Optimization Techniques—Numerical Methods and Technical Applications. Springer LNEMS V. 513, 91–102.
Deák, I. (2003). “Solving Stochastic Programming Problems by Successive Regression Approximations—Numerical Results.” In K. Marti, Yu. Ermoliev, and G. Pflug (eds.), Dynamic Stochastic Optimization. Springer LNEMS V. 532, 209–224.
Hammersley, J.M. and D.C. Handscomb. (1964). Monte Carlo methods. Methuen, London.
Higle, J.L. and S. Sen. (1996). Stochastic Decomposition: a Statistical Method for Large Scale Stochastic Linear Programming. Kluwer Academic Publishers.
Kall, P. and S.W. Wallace. (1994). Stochastic Programming. Wiley, p. 307.
Khuri, A.I. and J.A. Cornell. (1987). Response Surfaces: Design and Analyses, Marcell Dekker. New York-Basel-Milwaukee.
Mayer, J. (1998). “Stochastic Linear Programming Algorithms.” Gordon and Breach Science Publishers, pp. 153.
Morton, D.P. (2002). Testing Solution Quality in Stochastic Programs, Submitted to the Proceedings of the OGOR-SVOR-GOR Conference. Klagenfurt.
Prékopa, A. (1995). “Stochastic Programming.” In Mathematics and its Applications 324, Kluwer.
Ruszczyński, A. and A. Świętanowski. (1997). “Accelerating the Regularized Decomposition Method for Two-Stage Stochastic Linear Problems.” European Journal of Operational Research 101, 328–342.
Sen, A. and M. Srivastava. (1990). Regression Analysis. Springer-Verlag.
Shapiro, A. and T. Homem-de-Mello. (1998). “A Simulation Based Approach to Two-Stage Stochastic Programming with Recourse.” Math. Programming 81, 301–325.
Wets, R.J.-B. and W.T. Ziemba. (eds.). (1999). “Stochastic Programming: State of the Art.” Ann. of Operations Research, Baltzer, 85, p. 285.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Deák, I. Two-stage stochastic problems with correlated normal variables: computational experiences. Ann Oper Res 142, 79–97 (2006). https://doi.org/10.1007/s10479-006-6162-2
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-6162-2