Sampling-based Approximation Algorithms for Multi-stage Stochastic

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 actual data. We consider a broad class of these problems in which the realized input is revealed through a series of stages, and hence are called multi-stage stochastic programming problems. Our main result is to give the first fully polynomial approximation scheme for a broad class of multi-stage stochastic linear programming problems with any constant number of stages. The algorithm analyzed, known as the sample average approximation (SAA) method, is quite simple, and is the one most commonly used in practice. The algorithm accesses the input by means of a “black box” that can generate, given a series of outcomes for the initial stages, a sample of the input according to the conditional probability distribution (given those outcomes). We use this to obtain the first polynomial-time approxima...

• Type: Conference
• Year: 2005
• Where: FOCS
• Authors: Chaitanya Swamy, David B. Shmoys
• Keywords: FOCS 2005, Optimization Problems, Programming Problems, Stochastic Optimization Problems, Theoretical Computer Science