Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numer. Math., 4:238–252, 1962.
P. Billingsley. Convergence of Probability Measures. Wiley, New York, 1968.
C. Borell. Convex set functions in d-space. Period. Math. Hungar., 6:111–136, 1975.
G.B. Dantzig and P.Q. Glynn. Parallel Processors for Planning Under Uncertainty. Preprint SOL-88-8R, Dept. Oper. Res., Stanford U., 1989.
H.P. Edmundson. Bounds on the Expectation of a Convex Function of a Random Variable. Technical Report Paper 982, The RAND Corporation, 1956.
Y. Ermoliev. Stochastic quasigradient methods and their application to systems optimization. Stochastics, 9:1–36, 1983.
Y.M. Ermoliev and V.I. Norkin. Normalized Convergence in Stochastic Optimization. Working Paper WP-89-091, IIASA Laxenburg, 1989.
Y. Ermoliev and R.J.-B. Wets, editors. Numerical Techniques for Stochastic Optimization. Volume 10 of Springer Series in Computational Mathematics, Springer-Verlag, Berlin, 1988.
K. Frauendorfer. Solving SLP recourse problems with arbitrary multivariate distributions — the dependent case. Math. Oper. Res., 13:377–394, 1988.
K. Frauendorfer. Stochastic Two-Stage Programming. Volume 392 of LN Econ. Math. Syst., Springer-Verlag, Berlin, 1992.
K. Frauendorfer and P. Kall. A solution method for SLP recourse problems with arbitrary multivariate distributions — the independent case. Probl. Control & Inform. Th., 17:177–205, 1988.
A. Gaivoronski. Interactive Program SQG-PC for Solving Stochastic Programming Problems on IBM PC/XT/AT Compatibles — User Guide —. Working Paper WP-88-11, IIASA Laxenburg, 1988.
J.L. Higle and S. Sen. Stochastic decomposition: an algorithm for two stage stochastic linear programs with recourse. Math. Oper. Res., 16:650–669, 1991.
G. Infanger. Monte Carlo (Importance) Sampling within a Benders' Decomposition Algorithm for Stochastic Linear Programs. Preprint SOL-89-13, Dept. Oper. Res., Stanford U., 1989.
J.L. Jensen. Sur les fonctions convexes et les inéglités entre les valeurs moyennes. Acta Mathematica, 30:173–177, 1906.
P. Kall. Approximations to stochastic programs with complete fixed recourse. Numer. Math., 22:333–339, 1974.
P. Kall. Stochastic Linear Programming. Springer-Verlag, Berlin, 1976.
P. Kall. On approximations and stability in stochastic programming. In J. Guddat, H.Th. Jongen, B. Kummer, and F. Nožička, editors, Parametric Optimization and Related Topics, pages 387–407, Akademie-Verlag, Berlin, 1987.
P. Kall. Stochastic programs with recourse: an upper bound and the related moment problem. ZOR, 31:A119–A141, 1987.
P. Kall and D. Stoyan. Solving stochastic programming problems with recourse including error bounds. Math. Operationsforsch. Statist., Ser. Opt., 13:431–447, 1982.
K. Marti. Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs. Volume 299 of LN Econ. Math. Syst., Springer-Verlag, Berlin, 1988.
K. Marti and E. Fuchs. Rates of convergence of semi-stochastic approximation procedures for solving stochastic optimization problems. Optimization, 17:243–265, 1986.
J. Mayer. Probabilistic Constrained Programming: A Reduced Gradient Algorithm Implemented on PC. Working Paper WP-88-39, IIASA Laxenburg, 1988.
A. Prékopa. Logarithmic concave measures with applications to stochastic programming. Acta Sci. Math. (Szeged), 32:301–316, 1971.
A. Prékopa. Eine Erweiterung der sogenannten Methode der zulässigen Richtungen der nichtlinearen Optimierung auf den Fall quasikonkaver Restriktionen. Math. Operationsforsch. Statist., Ser. Opt., 5:281–293, 1974.
A. Prékopa, S. Ganczer, I. Deák, and K. Patyi. The STABIL stochastic programming model and its experimental application to the electricity production in Hungary. In M.A.H. Dempster, editor, Stochastic Programming, pages 369–385, Academic Press, London, 1980.
Y. Rinott. On convexity of measures. Ann. Prob., 4:1020–1026, 1976.
S.M. Robinson and R.J.-B. Wets. Stability in two stage programming. SIAM J. Contr. Opt., 25:1409–1416, 1987.
A. Ruszczyński. A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Prog., 35:309–333, 1986.
A. Ruszczyński. Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results. Working Paper WP-93-21, IIASA Laxenburg, 1993.
B. Strazicky. On an algorithm for solution of the two-stage stochastic programming problem. Methods of Oper. Res., 19:142–156, 1974.
T. Szántai. Calculation of the Multivariate Probability Distribution Function Values and their Gradient Vectors. Working Paper WP-87-82, IIASA Laxenburg, 1987.
T. Szántai. A computer code for solution of probabilistic-constrained stochastic programming problems. In Y.M. Ermoliev and R. J.-B. Wets, editors, Numerical Techniques for Stochastic Optimization, pages 229–235, Springer-Verlag, Berlin, 1988. Springer Ser. Computat. Math., vol. 10.
R. Van Slyke and R. J-B. Wets. L-shaped linear program with applications to optimal control and stochastic linear programs. SIAM J. Appl. Math., 17:638–663, 1969.
R.J.-B. Wets. Solving stochastic programs with simple recourse. Stochastics, 10:219–242, (1983).
R.J.-B. Wets. Stochastic programming. In G.L. Nemhauser et al., editors, Handbooks in OR & MS, vol. 1, pages 573–629, Elsevier, 1989. Survey.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Kall, P. (1994). Solution methods in stochastic programming. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035456
Download citation
DOI: https://doi.org/10.1007/BFb0035456
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19893-2
Online ISBN: 978-3-540-39337-5
eBook Packages: Springer Book Archive