Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ORL
2006

favoriteEmaildiscussreport

118views more ORL 2006»

On complexity of multistage stochastic programs

13 years 11 months ago

On complexity of multistage stochastic programs

Download www.optimization-online.org

In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample average approximation method. The presented analysis is self contained and is based on a, relatively elementary, one dimensional Cram

Alexander Shapiro

Real-time Traffic

Large Deviations | Multistage Stochastic Programming | ORL 2006 | Stochastic Programming |

claim paper

Related Content

» Stochastic programming approach to optimization under uncertainty

» Multistage KMeans Clustering for Scenario Tree Construction

» Optimization under uncertainty stateoftheart and opportunities

» On Stability of Multistage Stochastic Programs

» On the convergence of stochastic dual dynamic programming and related methods

» Aggregation and discretization in multistage stochastic programming

» MultiStage Investment Decision under Contingent Demand for Networking Planning

» Solving multistage asset investment problems by the sample average approximation method

» Application of multistage stochastic programs solved in parallel in portfolio management

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	ORL
Authors	Alexander Shapiro

Comments (0)