When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-562
Go to the corresponding Portal

Dye, Shane

Subtree decomposition for multistage stochastic programs

05031.DyeShane.ExtAbstract.56.pdf (0.04 MB)


A class of algorithms for solving multistage stochastic recourse problems is described. The scenario tree is decomposed using a covering collection of subtrees. The approach is illustrated with two examples: adapting the diagonal quadratic approximation algorithm and adapting nested Bender's decomposition. The approach leads to a class of methods based on the subtree cover chosen (including the original implementation of the algorithm adapted). This approach increases flexibility in the size, number and structure of subproblems for multistage stochastic programming decomposition methods.

BibTeX - Entry

  author =	{Shane Dye},
  title =	{Subtree decomposition for multistage stochastic programs},
  booktitle =	{Algorithms for Optimization with Incomplete Information},
  year =	{2005},
  editor =	{Susanne Albers and Rolf H. M{\"o}hring and Georg Ch. Pflug and R{\"u}diger Schultz},
  number =	{05031},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords:  Stochastic programming , scenario tree , decomposition}

Keywords: Stochastic programming , scenario tree , decomposition
Seminar: 05031 - Algorithms for Optimization with Incomplete Information
Issue Date: 2005
Date of publication: 27.05.2005

DROPS-Home | Fulltext Search | Imprint Published by LZI