Abstract
In this paper, we are concerned with an algorithm which combines the generalized linear programming technique proposed by Dantzig and Wolfe with the stochastic quasigradient method in order to solve stochastic programs with recourse. In this way, we overcome the difficulties arising in finding the exact values of the objective function of recourse problems by replacing them with the statistical estimates of the function. We present the basic steps of the proposed algorithm focusing our attention on its implementation alternatives aimed at improving both the convergence and computational performances. The main application areas are mentioned and some computational experience in the validation of our approach is reported. Finally, we discuss the possibilities of parallelization of the proposed algorithmic schemes.
Similar content being viewed by others
References
J.R. Birge and R.J.-B Wets, Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse, Math. Progr. Study 27(1986)54–102.
A. Brearley, G. Mitra and H.P. Williams, Analysis of mathematical programming problems prior to applying the simplex algorithm, Math. Progr. 8(1975)54–83.
G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1980).
Yu. Ermoliev, A.A. Gaivoronski and C. Nedeva, Stochastic programming problems with incomplete information on distribution functions, SIAM J. Contr. Optim. 23 (1986).
Yu. Ermoliev and R.J-B Wets,Numerical Techniques for Stochastic Optimization (Springer, Berlin, 1988).
A.A. Gaivoronski, Stochastic methods and their implementation, in:Numerical Techniques for Stochastic Optimization, ed. Yu. Ermoliev and R.J-B Wets (Springer, 1988) pp. 313–352.
A.A. Gaivoronski and J.L. Nazareth, Combining generalized programming and sampling techniques for stochastic programs with recourse, in:Resource Planning Under Uncertainty, ed. G. Dantzig and P. Glynn, Stanford University (1989).
J.L. Higle and S. Sen, Stochastic decomposition: An algorithm for stage linear programs with recourse, Math. Oper. Res. 16(1991)650–669.
P. Kall,Stochastic Linear Programming (Springer, Berlin, 1976).
A. King, Asymmetric measures and tracking models for portfolio optimization under uncertainty, IBM Europe Institute, Oberlech, Austria (1992).
J.M. Mulvey, R.J. Vanderbei and S.A. Zenios, Robust optimization of large scale systems: General modeling framework and computations, Statistics and Operations Research Series, SOR.91-13 (1991).
J.L. Nazareth, Algorithms based upon generalized linear programming for stochastic programs with recourse, in:Stochastic Programming: Algorithms and Applications, Gargnano, Italy, ed. F. Archetti, Lecture Notes on Control and Information Science 86 (Springer, Berlin, 1986).
J.L. Nazareth and R.J-B Wets, Nonlinear programming techniques applied to stochastic programs with recourse, in:Numerical Techniques for Stochastic Optimization, ed. Yu. Ermoliev and R.J-B Wets (Springer, 1988) pp. 95–121.
Optimization Subroutine Library, Guide and References, IBM Corporation (1992).
A. Prékopa, Contributions to the theory of stochastic programming, Math. Progr. 4(1973)202–221.
J. Savard, Contribution à programmation mathématique à deux niveaux, Ph.D. Thesis, University of Montreal (1989).
R.J-B Wets, Approximation formulas for stochastic linear programming, SIAM J. Appl. Math. 14(1966)668–677.
Author information
Authors and Affiliations
Additional information
This paper has been partially supported by the Italian MURST 40% project on “Flexible Manufacturing Systems”.
Rights and permissions
About this article
Cite this article
Gaivoronski, A.A., Messina, E. & Sciomachen, A. A statistical generalized programming algorithm for stochastic optimization problems. Ann Oper Res 58, 295–321 (1995). https://doi.org/10.1007/BF02038859
Issue Date:
DOI: https://doi.org/10.1007/BF02038859