Skip to main content

Recourse Models

  • Chapter
  • First Online:
Stochastic Programming

Abstract

It is fair to say that recourse models are the most important class of models in stochastic programming, both in theory and in applications. Recourse models are reformulations of decision problems that model stochastic infeasibilities by means of corrections afterwards. The penalty costs of such corrections are included in the objective function. After an introduction of such recourse actions in deterministic LP, this chapter discusses the basics of recourse models in stochastic linear programming: representations, modeling, properties, and algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. J.F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238–252, 1962.

    Article  Google Scholar 

  2. K. Frauendorfer. Stochastic two-stage programming, volume 392 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1992. Habilitationsschrift, University of Zürich, Zürich, 1992.

    Book  Google Scholar 

  3. P. Kall and J. Mayer. SLP-IOR: An interactive model management system for stochastic linear programs. Math. Program., 75(2):221–240, 1996.

    Article  Google Scholar 

  4. P. Kall and D. Stoyan. Solving stochastic programming problems with recourse including error bounds. Math. Operationsforsch. Statist. Ser. Optim., 13(3):431–447, 1982.

    Article  Google Scholar 

  5. W.K. Klein Haneveld and M.H. van der Vlerk. Integrated chance constraints: reduced forms and an algorithm. Computational Management Science, 3(4):245–269, 2006.

    Article  Google Scholar 

  6. J. Mayer. Stochastic Linear Programming Algorithms: A Comparison Based on a Model Management System. Optimization theory and applications; v. 1. Gordon and Breach Science Publishers, OPA Amsterdam, The Netherlands, 1998.

    Google Scholar 

  7. R. Van Slyke and R.J-B. Wets. L-shaped linear programs with applications to control and stochastic programming. SIAM Journal on Applied Mathematics, 17:638–663, 1969.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Klein Haneveld, W.K., van der Vlerk, M.H., Romeijnders, W. (2020). Recourse Models. In: Stochastic Programming. Graduate Texts in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-030-29219-5_3

Download citation

Publish with us

Policies and ethics