Skip to main content
SpringerLink
Log in

Algorithms based upon generalized linear programming for stochastic programs with recourse

  • Part. II — Stochastic Optimization
  • Conference paper
  • First Online:
Stochastic Programming

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 76))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birge, J. (1982):Decomposition and Partitioning methods for multistage stochastic linear programs, Tech. Report 82-6, Dept. of IE & OR, University of Michigan.

    Google Scholar 

  2. Birge, J. (1983): Using sequential approximations in the L-shaped and generalized programming algorithms for stochastic linear programs, Tech. Report 83-12, Dept. of IE & OR, University of Michigan.

    Google Scholar 

  3. Bisschop, J. and Meeraus, A. (1977): Matrix augmentation and partitioning in the updating of the basis inverse, Mathematical Programming, 18, 7–15.

    Google Scholar 

  4. Cleef, H. (1981): A solution procedure for the two-stage stochastic program with simple recourse, Z. Operations Research, 25, p. 1–13.

    Google Scholar 

  5. Dantzig, G.B. (1963): Linear Programming and Extensions, Princeton University Press.

    Google Scholar 

  6. Eaves, B.C. and Zangwill, W. (1971): Generalized cutting plane algorithms, SIAM J. Control, 9, p. 529–542.

    Google Scholar 

  7. Ermoliev, Yu. (1983): Stochastic quasigradient methods and their application in systems optimization, Stochastics, 9, p. 1–36.

    Google Scholar 

  8. Gill, P.E., Murray, W., Saunders, M.A. and Wright, M.H. (1982): Sparse matrix methods in optimization, Tech. Report SOL-82-17, Systems Optimization Lab., Dept. of Operations Research, Stanford University.

    Google Scholar 

  9. Ho, J. (1974): Nested decomposition for large scale linear programs with the staircase structure, Report SOL-74-4. Systems Optimization Lab., Dept. of Operations Research, Stanford University.

    Google Scholar 

  10. Kallberg, J. and Kusy, M. (1976): Code Instruction for S.L.P.R., a stochastic linear program with simple recourse, Tech. Report, University of British Columbia.

    Google Scholar 

  11. Lemarechal, C. (1982): Numerical experiments in nonsmooth optimization, In: Progress in Nondifferentiable Optimization, E.A. Nurminski (Ed.), IIASA Collaborative Proceedings Series CP-82-S8, p. 61–84.

    Google Scholar 

  12. Murtagh, B. and Saunders, M. (1978): Large-scale linearly constrained optimization, Mathematical Programming 14, p. 41–72.

    Google Scholar 

  13. Nazareth, L. (1983): Variants on Dantzig-Wolfe decomposition with applications to multistage problems, IIASA Working Paper, WP-83-61, Laxenburg, Austria.

    Google Scholar 

  14. Nazareth, L. and Wets, R. J-B. (1983): Algorithms for stochastic programs: the case of nonstochastic tenders, IIASA Working Paper, WP-83-5 (revised version to appear in forthcoming Mathematical Programming Study).

    Google Scholar 

  15. Nazareth, L and Wets, R.J-B. (1984): Stochastic programming with recourse: algorithms and implementation, IIASA Working Paper (forthcoming).

    Google Scholar 

  16. Parikh, S.C. (1968): Lecture notes on stochastic programming, unpublished, University of California, Berkeley.

    Google Scholar 

  17. Polyak, B. (1978): Nonlinear programming methods in the presence of noise, Mathematical Programming, 14, p. 87–97.

    Google Scholar 

  18. Shapiro, J.F. (1979): Mathematical Programming: Structures and Algorithms, John Wiley, New York.

    Google Scholar 

  19. Van Slyke, R. and Wets, R. (1979): L-shaped linear programs with applications to optimal control and stochastic linear programs, SIAM J. on Appl. Math., 17, pp. 638–663.

    Google Scholar 

  20. Wets, R. (1972): Characterization theorems for stochastic programs, Mathematical Programming, 2, 166–175.

    Google Scholar 

  21. Wets, R. (1974): Stochastic programming, unpublished, Lecture Notes, University of California, Berkeley.

    Google Scholar 

  22. Wets, R. (1983a): Stochastic programming: approximation schemes and solution techniques, In: Mathematical Programming 1982: The State-of-the-Art, Springer-Verlag, Berlin.

    Google Scholar 

  23. Wets, R. (1983b): Solving stochastic programs with simple recourse, Stochastics, 10, p. 219–242.

    Google Scholar 

  24. Williams, A.C. (1966): Approximation formulas for stochastic linear programming, SIAM J. Appl. Math., 14, No. 4, p. 668–677.

    Google Scholar 

  25. Ziemba, W.T. (1972): Solving nonlinear problems with stochastic objective functions, Journal of Financial and Quantitative Analysis, VII, p. 1809–1827.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IIASA, A-2361, Laxenburg, Austria

    J. L. Nazareth

Authors
  1. J. L. Nazareth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Archetti G. Di Pillo M. Lucertini

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Nazareth, J.L. (1986). Algorithms based upon generalized linear programming for stochastic programs with recourse. In: Archetti, F., Di Pillo, G., Lucertini, M. (eds) Stochastic Programming. Lecture Notes in Control and Information Sciences, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006874

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16044-1

  • Online ISBN: 978-3-540-39729-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation