Abstract
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizations of the data. We consider a broad class of these problems, called {it multistage stochastic programming problems with recourse}, where the uncertainty evolves through a series of stages and one take decisions in each stage in response to the new information learned. These problems are often computationally quite difficult with even very specialized (sub)problems being $#P$complete.
We obtain the first fully polynomial randomized approximation scheme (FPRAS) for a broad class of multistage stochastic linear programming problems with any constant number of stages, without placing any restrictions on the underlying probability distribution or on the cost structure of the input. For any fixed $k$, for a rich class of $k$stage stochastic linear programs (LPs), we show that, for any probability distribution, for any $epsilon>0$, one can compute, with high probability, a solution with expected cost at most $(1+e)$ times the optimal expected cost, in time polynomial in the input size, $frac{1}{epsilon}$, and a parameter $lambda$ that is an upper bound on the costinflation over successive stages. Moreover, the algorithm analyzed is a simple and intuitive algorithm that is often used in practice, the {it sample average approximation} (SAA) method. In this method, one draws certain samples from the underlying distribution, constructs an approximate distribution from these samples, and solves the stochastic problem given by this approximate distribution. This is the first result establishing that the SAA method yields nearoptimal solutions for (a class of) multistage programs with a polynomial number of samples.
As a corollary of this FPRAS, by adapting a generic rounding technique of Shmoys and Swamy, we also obtain the first approximation algorithms for the analogous class of multistage stochastic integer programs, which includes the multistage versions of the set cover, vertex cover, multicut on trees, facility location, and multicommodity flow problems.
BibTeX  Entry
@InProceedings{swamy_et_al:DagSemProc.07391.2,
author = {Swamy, Chaitanya and Shmoys, David},
title = {{Samplingbased Approximation Algorithms for Multistage Stochastic Optimization}},
booktitle = {Probabilistic Methods in the Design and Analysis of Algorithms},
pages = {124},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {18624405},
year = {2007},
volume = {7391},
editor = {Martin Dietzfelbinger and ShangHua Teng and Eli Upfal and Berthold V\"{o}cking},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2007/1290},
URN = {urn:nbn:de:0030drops12906},
doi = {10.4230/DagSemProc.07391.2},
annote = {Keywords: Stochastic optimization, approximation algorithms, randomized algorithms, linear programming}
}
Keywords: 

Stochastic optimization, approximation algorithms, randomized algorithms, linear programming 
Collection: 

07391  Probabilistic Methods in the Design and Analysis of Algorithms 
Issue Date: 

2007 
Date of publication: 

18.12.2007 