Abstract
Separable sublinear functions are used to provide upper bounds on the recourse function of a stochastic program. The resulting problem's objective involves the inf-convolution of convex functions. A dual of this problem is formulated to obtain an implementable procedure to calculate the bound. Function evaluations for the resulting convex program only require a small number of single integrations in contrast with previous upper bounds that require a number of function evaluations that grows exponentially in the number of random variables. The sublinear bound can often be used when other suggested upper bounds are intractable. Computational results indicate that the sublinear approximation provides good, efficient bounds on the stochastic program objective value.
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, “Using sequential approximations in the L-shaped and generalized programming algorithms for stochastic linear programs,” Technical Report No. 83-12, Department of Industrial and Operations Engineering, The University of Michigan (Ann Arbor, MI, 1983).
J.R. Birge, “Decomposition and partitioning methods for multi-stage stochastic linear programs,”Operations Research 33 (1985) 989–1007.
J.R. Birge, “An L-shaped computer code for multi-stage stochastic linear programs,” in: Y. Ermoliev and R. Wets, eds.,Numerical Methods in Stochastic Optimization (Springer-Verlag, Berlin, 1987) to appear.
J.R. Birge and R.J-B. Wets, “Approximations and error bounds in stochastic programming,” in: Y. Tong, ed.,Inequalities in Statistics and Probability, IMS Lecture Notes-Monograph Series Vol. 5 (Institute of Mathematical Statistics, Hayward, CA, 1984) pp. 178–186.
J.R. Birge and R.J-B. Wets, “Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse,”Mathematical Programming Study 27 (1986) 54–102.
J.R. Birge and R.J-B. Wets, “On-line solution of linear programs using sublinear functions,” Technical Report No. 86-25, Department of Industrial and Operations Engineering, The University of Michigan (Ann Arbor, MI, 1986).
J.R. Birge and R.J-B. Wets, “Computing bounds for stochastic programming problems by means of a generalized moment problem,”Mathematics of Operations Research 12 (1987) 149–162.
G.B. Dantzig and A. Madansky, “On the solution of two-stage linear programs under uncertainty,” in: J. Neyman, ed.,Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley, 1961) pp. 165–176.
Y. Ermoliev, “Stochastic quasigradient methods and their applications to systems optimization,”Stochastics 9 (1983) 1–36.
Y. Ermoliev and A. Gaivoronski, “Stochastic quasigradient methods and their implementation,” in: Y. Ermoliev and R. Wets, eds.,Numerical Methods in Stochastic Optimization (Springer-Verlag, Berlin, 1987) to appear.
A. Geoffrion, “Duality in nonlinear programming: a simplified applications-oriented development,”SIAM Review 13 (1971) 1–37.
P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, London and New York, 1981).
C.C. Huang, W. Ziemba and A. Ben-Tal, “Bounds on the expectation of a convex function of a random variable: with applications to stochastic programming,”Operations Research 25 (1979) 315–325.
P. Kall, “Computational methods for solving two-stage stochastic linear programming problems,”Zeitschrift für Angewandte Mathematik und Physik 30 (1979) 261–271.
P. Kall, K. Frauendorfer and A. Ruszczynski, “Approximation techniques in stochastic programming,” in: Y. Ermoliev and R. Wets, eds.,Numerical Methods in Stochastic Optimization (Springer-Verlag, Berlin, 1987) to appear.
P. Kall and E. Keller, “Computational experience in solving stochastic programs,” Technical Report, Institut für Operations Research, Universität Zürich (Zürich, 1983).
P. Kall and D. Stoyan, “Solving stochastic programming problems with recourse including error bounds,”Mathematische Operationsforschung und Statistik Series Optimization 13 (1982) 431–447.
C. Lemaréchal, “Bundle methods in nondifferentiable optimization,” in: C. Lemaréchal and R. Mifflin, eds.,Nonsmooth Optimization (Pergamon Press, Oxford, 1978) pp. 79–102.
C. Lemaréchal, J.J. Strodiot and A. Bihain, “On a bundle algorithm for nonsmooth optimization,” in: O. Mangasarian, S. Robinson and R. Meyer, eds.,Nonlinear Programming 4 (Academic Press, New York, 1981) pp. 245–282.
F.V. Louveaux, “Optimal investment for electricity generation: A stochastic model and a test problem,” in: Y. Ermoliev and R. Wets, eds.,Numerical Methods in Stochastic Optimization (Springer-Verlag, Berlin, 1987) to appear.
A. Madansky, “Bounds on the expectation of a convex function of a multivariate random variable,”Annals of Mathematical Statistics 30 (1959) 743–746.
K. Marti, “Approximationen von Entscheidungsproblemen mit linearer Ergebnisfunktion und positiv homogener, subadditiver Verlusfunktion,”Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 31 (1975) 203–233.
B.A. Murtagh and M.A. Saunders, “MINOS/AUGMENTED user's manual,” Technical Report SOL 80-14, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1980).
J.L. Nazareth and R.J-B. Wets, “Algorithms for stochastic programs: The case of nonstochastic tenders,”Mathematical Programming Study 28 (1986) 1–28.
S.C. Parikh, “Lecture notes on stochastic programming,” Unpublished lecture notes, University of California (Berkeley, CA, 1968).
E. Polak, “On the mathematical foundations of nondifferentiable optimization in engineering design,”SIAM Review 29 (1987) 21–90.
A. Prékopa, “Boole-Bonferroni inequalities and linear programming,” Rutgers Research Report #4-86, Rutgers Center for Operations Research, Rutgers University (New Brunswick, NJ, 1986).
L. Qi, “An alternating method for stochastic linear programming with simple recourse,”Mathematical Programming Study 27 (1986) 183–190.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, New Jersey, 1970).
R.T. Rockafellar,Conjugate Duality and Optimization (SIAM Publications, Philadelphia, 1974).
R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley, New York, 1984).
B. Strazicky, “Computational experience with an algorithm for discrete recourse problems,” in: M.A.H. Dempster, ed.,Stochastic Programming, Proceedings of the 1974 Oxford International Conference (Academic Press, London, 1980) pp. 263–274.
R. Van Slyke and R.J-B. Wets, “L-shaped linear programs with application to optimal control and stochastic programming,”SIAM Journal on Applied Mathematics 17 (1969) 638–663.
S.W. Wallace, “A piecewise linear upper bound on the network recourse problem,”Mathematical Programming 38 (1987) 133–146.
R.J-B. Wets, “Programming under uncertainty: The complete problem,”Zeitschrift für Wahrscheinlich-keitstheorie und Verwandte Gebiete 4 (1966) 316–339.
R.J-B. Wets, “Stochastic programming,” Unpublished lecture notes, University of Kentucky (Lexington, KY, 1974).
R.J-B. Wets, “Stochastic programs with fixed recourse: The equivalent deterministic problem,”SIAM Review 16 (1974) 309–339.
R.J-B. Wets, “Solving stochastic programs with simple recourse, II,” in:Proceedings of 1975 Conference on Information Sciences and Systems (Johns Hopkins University, Baltimore, Maryland, 1975).
R.J-B. Wets, “Large scale linear programming techniques in stochastic programming,” in: Y. Ermoliev and R. Wets, eds.,Numerical Methods in Stochastic Optimization (Springer-Verlag, Berlin, 1987) to appear.
P. Wolfe, “A method of conjugate subgradients for minimizing convex functions,”Mathematical Programming Study 3 (1975) 145–173.
Author information
Authors and Affiliations
Additional information
This research has been partially supported by the National Science Foundation. The first author's work was also supported in part by Office of Naval Research Grant N00014-86-K-0628 and by the National Research Council under a Research Associateship at the Naval Postgraduate School, Monterey, California.
Rights and permissions
About this article
Cite this article
Birge, J.R., Wets, R.J.B. Sublinear upper bounds for stochastic programs with recourse. Mathematical Programming 43, 131–149 (1989). https://doi.org/10.1007/BF01582286
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582286