Abstract
Multistage stochastic programs with continuous underlying distributions involve the obstacle of high-dimensional integrals where the integrands' values again are given by solutions of stochastic programs. A common solution technique consists of discretizing the support of the original distributions leading to scenario trees and corresponding LPs which are – up to a certain size – easy to solve. In order to improve the accuracy of approximation, successive refinements of the support result in rapidly expanding scenario trees and associated LPs. Hence, the solvability of the multistage stochastic program is limited by the numerical solvability of sequences of such expanding LPs. This work describes an algorithmic technique for solving the large-scale LP of refinement ν based on the solutions at the previous ν−1 refinements. Numerical results are presented for practical problem statements within financial applications demonstrating significant speedup (depending on the size of the LP instances).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Birge, J.R. (1995). “Current Trends in Stochastic Programming Computation and Applications.” Working Paper, Department of Industrial and Operations Engineering, University of Michigan.
Birge, J.R. and F. Louveaux. (1997). Introduction to Stochastic Programming. New York: Springer.
Birge, J.R. and L. Qi. (1995). “Continuous Approximation Schemes for Stochastic Progams.” Annals of Operations Research 56, 15–38.
Birge, J.R. and S.W. Wallace. (1988). “A Separable Piecewise Linear Upper Bound for Stochastic Linear programs.” SIAM Journal on Control and Optimization 26, 725–739.
Birge, J.R. and R.J.-B. Wets. (1989). “Sublinear Upper Bounds for Stochastic Programs with Recourse.” Mathematical Programming 43, 131–149.
CPLEX. (1997). CPLEX Documentation, Version 5.0 of the CPLEX Callable Library. ILOG Inc., CPLEX Division, Incline Village, USA.
Frauendorfer, K. (1992). Stochastic Two-Stage Programming. Lecture Notes in Economics and Mathematical Systems, Vol. 392. Berlin: Springer.
Frauendorfer, K. (1994). “Multistage Stochastic Programming: Error Analysis for the Convex Case.” Zeitschrift für Operations Research 39(1), 93–122.
Frauendorfer, K. (1996). “Barycentric Scenario Trees in Convex Multistage Stochastic Programming.” Mathematical Programming 75(2), 277–294.
Frauendorfer, K. and G. Haarbrücker. (2000). “Test Problems in Stochastic Multistage Programming.” Optimization 47(3-4), 267–285.
Frauendorfer, K. and C. Marohn. (1998). “Refinement Issues in Stochastic Multistage Linear Programming.” In K. Marti and P. Kall (eds.), Stochastic Programming Methods and Technical Applications (Proceedings of the 3rd GAMM/IFIP Workshop 1996), Lecture Notes in Economics and Mathematical Systems, Vol. 458. Berlin: Springer, pp. 305–328.
Gaese, R. (1999). “Risk Management and Risk Measurement.” Ph.D. Thesis No. 2195, University of St. Gallen.
Haarbrücker, G. (1999). “Generalized Barycenters of Cross Simplices: An Illustrative Approach.” Working Paper WP gh-07/1999-02, Institute of Operations Research, University of St. Gallen.
Haarbrücker, G. (2000). “Sequentielle Optimierung verfeinerter Approximationen in der mehrstufigen stochastischen linearen Programmierung.” Doctoral Thesis No. 2410, University of St. Gallen.
Kall, P., A. Ruszczyński, and K. Frauendorfer. (1988). “Approximations in Stochastic Programming.” In Y. Ermoliev and R.J.-B. Wets (eds.), Numerical Techniques for Stochastic Optimization. Springer Series in Computational Mathematics, Vol. 10, pp. 33–64.
Kall, P. and S.W. Wallace. (1994). Stochastic Programming. Chichester: Wiley.
Marohn, C. (1998). Stochastische mehrstufige lineare Programmierung im Asset and LiabilityManagement. Bank-und finanzwirtschaftliche Forschungen, Bd. 282. Bern: Paul Haupt Verlag.
Rockafellar, R. (1997). Convex Analysis. Princeton Landmarks in Mathematics. Princeton: Princeton University Press.
Ruszczyński, A. (1999). “Some Advances in Decomposition Methods for Stochastic Linear Programming.” Annals of Operations Research 85, 153–172.
Ruszczyński, A. and A. Swietanowski. (1997). “Accelerating the Regularized Decomposition Method for Two Stage Stochastic Linear Problems.” European Journal of Operational Research 101(2), 328–342.
Schürle, M. (1998). Zinsmodelle in der stochastischen Optimierung. Bank-und finanzwirtschaftliche Forschungen, Bd. 279. Bern: Paul Haupt Verlag.
Wallace, S.W. (1986). “Solving Stochastic Programs with Network Recourse.” Networks 16, 295–317.
Wets, R.J.-B. (1972). “Stochastic Programs with Recourse: A Basic Theorem for Multistage Problems.” Zeitschrift Wahrscheinlichkeitstheorie und verwandte Gebiete 21, 201–206.
Wets, R.J.-B. (1974). “Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program.” SIAM Review 16, 309–339.
Wets, R.J.-B. (1989). “Stochastic Programming.” In G.L. Nemhauser et al. (eds.), Handbooks in Operations Research and Management Science, 1: Optimization, Amsterdam: Elsevier Science Publishers, pp. 573–629.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Frauendorfer, K., Haarbrücker, G. Solving Sequences of Refined Multistage Stochastic Linear Programs. Annals of Operations Research 124, 133–163 (2003). https://doi.org/10.1023/B:ANOR.0000004766.05076.9d
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000004766.05076.9d