Skip to main content
SpringerLink
Log in

A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs

  • Published:
Mathematical Programming Submit manuscript

Abstract

Multistage stochastic linear programs can represent a variety of practical decision problems. Solving a multistage stochastic program can be viewed as solving a large tree of linear programs. A common approach for solving these problems is the nested decomposition algorithm, which moves up down the tree by solving nodes and passing information among nodes. The natural independence of subtrees suggests that much of the computational effort of the nested decomposition algorithm can run in parallel across small numbers of fast processors. This paper explores the advantages of such parallel implementations over serial implementations and compares alternative sequencing protocols for parallel processors. Computational experience on a large test set of practical problems with up to 1.5 million constraints and almost 5 million variables suggests that parallel implementations may indeed work well, but they require careful attention to processor load balancing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.A. Ariyawansa and D.D. Hudson, “Performance of a benchmark parallel implementation of the Van Slyke and Wets algorithm for two-stage stochastic programs on the Sequent/Balance,”Concurrency: Practice and Experience 3 (2) (1991) 109–128.

    Article  Google Scholar 

  2. A.J. Berger, J.M. Mulvey, and A. Ruszczyński, “A distributed scenario decomposition algorithm for large stochastic programs,” Technical Report SOR-93-2, Department of Civil Engineering and Operations Research Princeton University, Princeton, NJ 08544 (1993).

    Google Scholar 

  3. J.R. Birge, “Decomposition and partitioning methods for stochastic linear programs,”Operations Research 33 (1985) 989–1007.

    MATH  MathSciNet  Google Scholar 

  4. J.R. Birge and D. Holmes, “Efficient solution of two-stage stochastic linear programs using interior point methods,”Computational Optimization and Applications 1 (1992) 245–276.

    Article  MATH  MathSciNet  Google Scholar 

  5. J.R. Birge and F.V. Louveaux, “A multicut algorithm for two-stage stochastic linear programs,”European Journal of Operations Research 34 (1988) 384–392.

    Article  MATH  MathSciNet  Google Scholar 

  6. J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, A.J. King and S.W. Wallace, “A Standard input format for multiperiod stochastic linear programs,”COAL Nesletter 17 (1987) 34354.

    Google Scholar 

  7. R. Entriken, “A parallel decomposition algorithm for staircase linear programs,” Technical Report SOL 88-21, Department of Operations Research, Stanford University, Stanford, CA 94305 (1988).

    Google Scholar 

  8. S. Gartska and D. Rutenberg, “Computation in discrete stochastic programs with recourse,”Operations Research 21 (1973) 112–122.

    MathSciNet  Google Scholar 

  9. H.I. Gassmann, “Optimal harvest of a forest in the presence of uncertainty,”Canadian Journal of Forest Research 19 (1989) 1267–1274.

    Google Scholar 

  10. H.I. Gassmann, “MSLiP: A computer code for the multistage stochastic linear programming problem,”Mathematical Programming 47 (1990) 407–423.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Geist, A. Beguelin, J. Dongarra, W. Jang, R. Mancheck and V. Sunderam, “PVM 3 users guide and reference manual,” Report ORNL/TM-12187, Department of Energy, Oak Ridge National Laboratory, Oak Ridge, TN (1993).

    Google Scholar 

  12. J.K. Ho and E. Loute, “A set of linear programming test problems,”Mathematical Programming 20 (1981) 245–250

    Article  MATH  MathSciNet  Google Scholar 

  13. D. Holmes, “SelectedMathematica routines for use in mathematical programming,” Technical Report 93-26. Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117 (1993).

    Google Scholar 

  14. D. Holmes, “A collection of stochastic programming problems,” Technical Report 94-11, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117 (1993).

    Google Scholar 

  15. D. Holmes, “On solving many LPs with similar RHSs on MIMD parallel architectures,” presented at ORSA/TIMS Conference, Boston, MA (1994).

  16. G. Infanger and D. Morton, “Interstage dependency in multistage stochastic linear programming,” Technical Report, Systems Optimization Laboratory, Standford University, Stanford, CA 94305 (1994).

    Google Scholar 

  17. International Business Machines Corp., Optimization subroutine libary guide and reference, release 2,” Document SC23-0519-02, International Business Machines Corp. (1991).

  18. J.M. Mulvey and A. Ruszczyński, “A new scenario decomposition method for large-scale stochastic optimization,” Technical Report SOR-91-19, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ 08544 (1992).

    Google Scholar 

  19. J.M. Mulvey and H. Vladimirou, “Stochastic network optimization models for investment planning,”Annals of Operations Research 20 (1989) 187–217.

    Article  MATH  MathSciNet  Google Scholar 

  20. S. Nielsen and S.A. Zenios, “A massively parallel algorithm for nonlinear stochastic network problems,”Operations Research 41 (2) (1993) 319–337.

    MATH  MathSciNet  Google Scholar 

  21. R.T. Rockafellar and R.J.-B. Wets, “Scenarios and policy aggregation in optimization under uncertainty,”Mathematics of Operations Research 16 (1991) 119–147.

    Article  MATH  MathSciNet  Google Scholar 

  22. A. Ruszczyński, “A regularized decomposition method for minimizing a sum of polyhedral functions,”Mathematical Programming 35 (1986) 309–333.

    Article  MathSciNet  MATH  Google Scholar 

  23. A. Ruszczyński, “Parallel decomposition of multistage stochastic programming problems,”Mathematical Programming 58 (1993) 201–228.

    Article  MathSciNet  MATH  Google Scholar 

  24. D.M. Scott, “A dynamic programming approach to time staged convex programs” Technical Report SOL 85-3, Systems Optimization Laboratory, Standford University, Stanford, CA 94305 (1985).

    Google Scholar 

  25. M.J. Sims, “Use of a stochastic capacity planning model to find the optimal level of flexibility for a manufacturing system,” Senior Design Project, University of Michigan, Ann Arbor, MI 48109-2117 (1992).

    Google Scholar 

  26. R. van Slyke and R.J.-B. Wets, “L-shaped linear programs with application to optimal control and stochastic optimization,”SIAM Journal on Applied Mathematics 17 (1969) 625–638.

    Article  Google Scholar 

  27. D. Walkup and R.J.-B. Wets, “Lifting projections of convex polyhedra,”Pacific Journal of Mathematics 28 (1969) 365–475.

    MathSciNet  Google Scholar 

  28. R.J.-B. Wets, “Large scale linear programming techniques,” in: Yu. Ermoliev and R.J.-B. Wets, eds.,Numerical Techniques for Stochastic Optimization (Springer, Berlin, 1988).

    Google Scholar 

  29. R. Wittrock, “Dual nested decomposition of staircase linear programs,”Mathematical Programming Study 24 (1985) 65–86.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Operations Engineering, University of Michigan, 48109-2117, MI, Ann Arbor, USA

    John R. Birge, Christopher J. Donohue, Derek F. Holmes & Oleg G. Svintsitski

Authors
  1. John R. Birge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christopher J. Donohue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Derek F. Holmes
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Oleg G. Svintsitski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to John R. Birge.

Additional information

Supported in part by the National Science Foundation under Grants DDM-9215921 and SES-9211937.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Birge, J.R., Donohue, C.J., Holmes, D.F. et al. A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs. Mathematical Programming 75, 327–352 (1996). https://doi.org/10.1007/BF02592158

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592158

Keywords

Search

Navigation