Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter 14: Stochastic Programming

Chapter 14: Stochastic Programming

pp. 129-141

Authors

, Carnegie Mellon University, Pennsylvania
Resources available Unlock the full potential of this textbook with additional resources. There are free resources and Instructor restricted resources available for this textbook. Explore resources
  • Add bookmark
  • Cite
  • Share

Extract

This chapter first describes general approaches for anticipating uncertainty in optimization models. The strategies include optimizing the expected value, minimax stategy, chance-constrained,two-stage and multistage programming, and robust optimization. The chapter focuses on the solution of two-stage stochastic MILP programming problems in which 0-1 variables are present in stage-1 decisions. The discretization of the uncertain parameters is described, which gives rise to scenario trees. We then present the extended MILP formulation that explicitly considers all possible scenarios. Since this problem can become too large, the Benders decomposition method (also known as the L-shaped method )is introduced, in which a master MILP problem is defined through duality in order to predict new integer values for stage-1 decisions, as well as a lower bound. The extension to multistage programming problems is also briefly discussed, as well as a brief reference to robust optmization in which the robust counterpart is derived.

Keywords

  • stochastic programming
  • L-shaped method
  • Benders decomposion
  • two-stage stochastic programming
  • multistage stochastic programming
  • robust optimization

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$111.00
Hardback
US$111.00

Have an access code?

To redeem an access code, please log in with your personal login.

If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.

Also available to purchase from these educational ebook suppliers