|edoc-Server der Humboldt-Universität zu Berlin|
|Title:||Decomposition of Multistage Stochastic Programs with Recombining Scenraio Trees|
|Date of Acceptance:||05.08.2007|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10078946)|
|Keywords (eng):||multistage stochastic programming, nested Benders decomposition, recombining scenario trees|
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|print on demand: If you click on this icon you can order a print copy of this publication.|
|This paper presents a decomposition approach for linear multistage stochastic programs, that is based on the concept of recombining scenario trees. The latter, widely applied in Mathematical Finance, may prevent the node number of the scenario tree to grow exponentially with the number of time stages. It is shown how this property may be exploited within a non-Markovian framework and under time-coupling constraints. Being close to the well-established Nested Benders Decomposition, our approach uses the special structure of recombining trees for simultaneous cutting plane approximations. Convergence is proved and stopping criteria are deduced. Techniques for the generation of suitable scenario trees and some numerical examples are presented.|
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Gesamtzahl der Zugriffe seit Jul 2011: