Standard Article

Decomposition Algorithms for Two-Stage Recourse Problems

  1. János Mayer

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0230

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Mayer, J. 2011. Decomposition Algorithms for Two-Stage Recourse Problems. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. University of Zurich, Institute for Operations Research, Zurich, Switzerland

Publication History

  1. Published Online: 15 FEB 2011

Abstract

In this article, decomposition methods for two-stage linear recourse problems with a finite discrete distribution are discussed. First, we cover the L-shaped decomposition method which represents a breakthrough concerning numerically efficient methods for solving two-stage recourse problems. This algorithm was the basis for the development of several other decomposition methods. After giving an overview of these algorithms, we present regularized decomposition and stochastic decomposition in a more detailed fashion. Variance for recourse-constrained problems and special cases including simple recourse with a random technology matrix are also considered. With reference to stochastic decomposition, the scope of which is not restricted to finite discrete distributions, algorithms for the continuous-distribution case are discussed briefly with references to the literature.

Keywords:

  • linear recourse problem;
  • L-shaped algorithm;
  • regularized decomposition;
  • two-stage recourse;
  • stochastic decomposition