This paper focuses on Benders decomposition techniques and Monte Carlo sampling (importance sampling) for solving two-stage stochastic linear programs with recourse, a method first introduced by Dantzig and Glynn . The algorithm is discussed and further developed. The paper gives a complete presentation of the method as it is currently implemented. Numerical results from test problems of different areas are presented. Using small test problems, we compare the solutions obtained by the algorithm with universe solutions. We present the solutions of large-scale problems with numerous stochastic parameters, which in the deterministic formulation would have billions of constraints. The problems concern expansion planning of electric utilities with uncertainty in the availabilities of generators and transmission lines and portfolio management with uncertainty in the future returns.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
M. Avriel, G.B. Dantzig and P.W. Glynn, Decomposition and parallel processing techniques for large scale electric power system planning under uncertainty,Proc. Workshop on Resource Planning Under Uncertainty, Stanford University (1989).
J.F. Benders, Partitioning procedures for solving mixed-variable programming problems, Numer. Math. 4(1962)238–252.
J.R. Birge, Decomposition and partitioning methods for multi-stage stochastic linear programming, Oper. Res. 33(1985)989–1007.
J.R. Birge and S.W. Wallace, A separable piecewise linear upper bound for stochastic linear programs, SIAM J. Control Optim. 26(1988)3.
J.R. Birge and R.J. Wets, Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse, Math. Progr. Study 27(1986)54–102.
G.B. Dantzig, Linear programming under uncertainty, Manag. Sci. 1(1955)197–206.
G.B. Dantzig and P.W. Glynn, Parallel processors for planning under uncertainty, Ann. Oper. Res. 22(1990)1–21.
G.B. Dantzig, P.W. Glynn, M. Avriel, J. Stone, R. Entriken and M. Nakayama, Decomposition techniques for multi-area generation and transmission planning under uncertainty, EPRI Report 2940-1 (1989).
P.J. Davis and P. Rabinowitz,Methods of Numerical Integration (Academic Press, London, 1984).
Y. Ermoliev, Stochastic quasi-gradient methods and their applications to systems optimization, Stochastics 9(1983)1–36.
Y. Ermoliev and R.J. Wets (eds.),Numerical Techniques for Stochastic Optimization (Springer, 1988).
K. Frauendorfer, Solving SLP recourse problems with arbitrary multivariate distributions — the dependent case, Math. Oper. Res. 13(1988)377–394.
K. Frauendorfer and P. Kall, Solving SLP recourse problems with arbitrary multivariate distributions — the independent case, Probl. Control Inf. Theory 17(1988)177–205.
A.M. Geoffrion, Elements of large-scale mathematical programming, Manag. Sci. 16, no. 11 (1974).
P.W. Glynn and D.L. Iglehart, Importance sampling for stochastic simulation, Manag. Sci. 35(1989)1367–1392.
J.M. Hammersly and D.C. Handscomb,Monte Carlo Methods (Methuen, London, 1964).
P. Hall, Rates of convergence in the central limit theorem, Res. Notes Math. 62 (1982).
J.L. Higle and S. Sen, Stochastic decomposition: An algorithm for two stage linear programs with recourse, Math. Oper. Res. (1989), to appear.
J.L. Higle, S. Sen and D. Yakowitz, Finite master programs in stochastic decomposition, Technical Report, Department of Systems and Industrial Engineering, University of Arozina, Tucson, AZ 85721.
P. Kall, Computational methods for two stage stochastic linear programming problems, Z. angew. Math. Phys. 30(1979)261–271.
P. Kall, A. Ruszczynski and K. Frauendorfer, Approximation techniques in stochastic programming, in:Numerical Techniques for Stochastic Optimization, ed. Y. Ermoliev and R.J. Wets (1988).
F.V. Louveaux and Y. Smeers, Optimal investment for electricity generation: A stochastic model and a test problem, in:Numerical Techniques for Stochastic Optimization, ed. Y. Ermoliev and R.J. Wets (1988).
J.M. Mulvey and H. Vladimirou, Specifying the progressive hedging algorithm to stochastic generalized networks, Sstatistics and Operations Research Series Report SOR-89-9, Princeton University, Princeton, NJ 08544 (1989).
B.A. Murtagh and M.A. Saunders, MINOS user's guide, SOL 82-20, Department of Operations Research, Stanford University, Stanford, CA 94305 (1983).
L. Nazareth and R.J. Wets, Algorithms for stochastic programs: The case of nonstochastic tenders, Math. Progr. Study 28(1987)48–62.
M.V. Pereira, L.M.V.G. Pinto, G.C. Oliveira and S.H.F. Cunha, A technique for solving LP-problems with stochastic right-hand sides, CEPEL, Centro del Pesquisas de Energia Electria, Rio de Janeiro, Brazil (1989).
R.T. Rockafellar and R.J. Wets, Scenario and policy aggregation in optimization under uncertainty, Math. Oper. Res. (1989), to appear.
A. Ruszczynski, A regularized decomposition method for minimizing a sum of polyhedral functions, Math. Progr. 35(1986)309–333.
R.M. Van Slyke and R.J. Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM J. Appl. Math. 17(1969)638–663.
R.J. Wets, Programming under uncertainty: The equivalent convex program, SIAM J. Appl. Math. 14(1984)89–105.
J. Tomlin, LPM1 user's guide, Manuscript, Systems Optimization Laboratory, Stanford University (1973), unpublished.
About this article
Cite this article
Infanger, G. Monte Carlo (importance) sampling within a benders decomposition algorithm for stochastic linear programs. Ann Oper Res 39, 69–95 (1992). https://doi.org/10.1007/BF02060936
- Test Problem
- Importance Sampling
- Decomposition Algorithm
- Monte Carlo Sampling
- Future Return