A Caltech Library Service

Approximation algorithms for 2-stage stochastic optimization problems

Swamy, Chaitanya and Shmoys, David B. (2006) Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News, 37 (1). pp. 33-46. ISSN 0163-5700. doi:10.1145/1122480.1122493.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


Uncertainty is a facet of many decision environments and might arise for various reasons, such as unpredictable information revealed in the future, or inherent fluctuations caused by noise. Stochastic optimization provides a means to handle uncertainty by modeling it by a probability distribution over possible realizations of the actual data, called scenarios. The field of stochastic optimization, or stochastic programming, has its roots in the work of Dantzig [4] and Beale [1] in the 1950s, and has since increasingly found application in a wide variety of areas, including transportation models, logistics, financial instruments, and network design. An important and widely-used model in stochastic programming is the 2-stage recourse model: first, given only distributional information about (some of) the data, one commits on initial (first-stage) actions. Then, once the actual data is realized according to the distribution, further recourse actions can be taken (in the second stage) to augment the earlier solution and satisfy the revealed requirements. The aim is to choose the initial actions so as to minimize the expected total cost incurred. The recourse actions typically entail making decisions in rapid reaction to the observed scenario, and are therefore more costly than decisions made ahead of time. Thus there is a trade-off between committing initially, having only imprecise information while incurring a lower cost, and deferring decisions to the second-stage, when we know the input precisely but the costs are higher. Many applications can be modeled this way, and much of the textbook of Birge and Louveaux [2] is devoted to models and algorithms for this class of problems. A commonly cited example involves a setting where a company has to decide where to set up facilities to serve client demands. Typically the demand pattern is not known precisely at the outset, but one might be able to obtain, through simulation models or surveys, statistical information about the demands. This motivates the following 2-step decision process: in the first-stage, given only distributional information about the demands (and deterministic data for the facility opening costs), one must decide which facilities to open initially; once the client demands are realized according to this distribution, we can extend the solution by opening more facilities, incurring a recourse cost, and we have to assign the realized demands to open facilities. This is the 2-stage stochastic uncapacitated facility location problem. The recourse costs are usually higher than the original ones (because opening a facility later would involve deploying resources with a small lead time); these costs could be different for the different facilities, and could even depend on the realized scenario.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 2006 ACM.
Issue or Number:1
Record Number:CaltechAUTHORS:20161220-153139901
Persistent URL:
Official Citation:Chaitanya Swamy and David B. Shmoys. 2006. Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News 37, 1 (March 2006), 33-46. DOI:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:73012
Deposited By: Kristin Buxton
Deposited On:20 Dec 2016 23:42
Last Modified:11 Nov 2021 05:10

Repository Staff Only: item control page