Abstract
Finding optimal decisions often involves the consideration of certain random or unknown parameters. A standard approach is to replace the random parameters by the expectations and to solve a deterministic mathematical program. A second approach is to consider possible future scenarios and the decision that would be best under each of these scenarios. The question then becomes how to choose among these alternatives. Both approaches may produce solutions that are far from optimal in the stochastic programming model that explicitly includes the random parameters. In this paper, we illustrate this advantage of a stochastic program model through two examples that are representative of the range of problems considered in stochastic programming. The paper focuses on the relative value of the stochastic program solution over a deterministic problem solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.R. Birge, The value of the stochastic solution in stochastic linear programs with fixed recourse, Math. Progr. 24(1982)314–325.
J.R. Birge, Decomposition and partitioning methods for multi-stage stochastic linear programs, Oper. Res. 33(1985)989–1007.
J.R. Birge and M.A.H. Dempster, Optimality conditions for match-up strategies in stochastic scheduling, Technical Report 92-58, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor (1992).
J.R. Birge and R.J-B Wets, Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse, Math. Prog. Study 27(1986)54–102.
A. Charnes and W.W. Cooper, Chance-constrained programming, Manag. Sci. 5(1959)73–79.
G.B. Dantzig and P. Glynn (eds.),Resource Planning under Uncertainty for Electric Power Systems (National Science Foundation, Washington, DC, 1989).
G.B. Dantzig and P. Glynn, Parallel processors for planning under uncertainty, Ann. Oper. Res. 22(1990)1–21.
M.A.H. Dempster, On stochastic programming II: Dynamic problems under risk, Stochastics 25(1988)15–42.
Y. Ermoliev, Stochastic quasigradient methods and their applications to systems optimization, Stochastics 9(1983)1–36.
H.I. Gassmann, MSLiP: A computer code for the multistage stochastic linear programming problem, Math. Progr. 47(1990)407–423.
B. Golub, M. Holmer, R. McKendall, L. Pohlman and S.A. Zenios, Stochastic programming models for money management, Euro. J. Oper. Res., to appear.
R.C. Grinold, Model building techniques for the correction of end effects in multistage convex programs, Oper. Res. 31(1983)407–431.
J. Higle and S. Sen, Stochastic decomposition: An algorithm for two-stage linear programs with recourse, Math. Oper. Res. 16(1991)650–669.
J.E. Ingersoll, Jr.,Theory of Financial Decision Making (Rowman and Littlefield Publishers, 1986).
P. Kall, A. Ruszczyński and K. Frauendorfer, Approximations in stochastic programming, in:Numerical Techniques for Stochastic Optimization, ed. Y. Ermoliev and R.J-B Wets (Springer, Berlin, 1988) pp. 33–64.
J.G. Kallberg and W.T. Ziemba, Comparison of alternative utility functions in portfolio selection problems, Manag. Sci. 29(1983)1257–1276.
A. King, Stochastic programming problems: Examples from the literature, in:Numerical Techniques for Stochastic Optimization, ed. Y. Ermoliev and R.J-B Wets (Springer, Berlin, 1988) pp. 543–567.
F.V. Louveaux, A solution method for multistage stochastic programs with recourse with application to an energy investment problem, Oper. Res. 28(1980)889–902.
A. Madansky, Inequalities for stochastic linear programming problems, Manag. Sci. 6(1960) 197–204.
J. Mulvey and H. Vladimirou, Stochastic network optimization models for investment planning, Ann. Oper. Res. 20(1989)187–217.
S.S. Nielsen and S.A. Zenios, A massively parallel algorithm for nonlinear stochastic network problems, Oper. Res. 41(1993)319–337.
M.C. Noël and Y. Smeers, Nested decomposition of multistage nonlinear programs with recourse, Math. Progr. 37(1987)131–152.
A. Prékopa, Numerical solution of probabilistic constrained programming problems, in:Numerical Techniques for Stochastic Optimization, ed. Y. Ermoliev and R.J-B Wets (Springer, Berlin, 1988) pp. 123–140.
G. Taguchi,Introduction to Quality Engineering (Asian Productivity Center, Tokyo, 1986).
G. Taguchi, E.A. Alsayed and T. Hsiang,Quality Engineering in Production Systems (McGraw-Hill, New York, 1989).
R.J-B Wets, Large-scale linear programming techniques in stochastic programming, in:Numerical Techniques for Stochastic Optimization, ed. Y. Ermoliev and R.J-B Wets (Springer, Berlin, 1988) pp. 65–94.
S.A. Zenios (ed.),Financial Optimization (Cambridge University Press, Cambridge, 1993).
W.T. Ziemba and R.G. Vickson (eds.),Stochastic Optimization Models in Finance (Academic Press, New York, 1975).
Author information
Authors and Affiliations
Additional information
The author's work was supported in part by the National Science Foundation under Grant DDM-9215921.
Rights and permissions
About this article
Cite this article
Birge, J.R. Models and model value in stochastic programming. Ann Oper Res 59, 1–18 (1995). https://doi.org/10.1007/BF02031741
Issue date:
DOI: https://doi.org/10.1007/BF02031741