This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Google Scholar Articles by Singh, K. J. Articles by Wood, R. K.

Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

Mighty River Power Limited, Auckland, New Zealand
Department of Engineering Science, University of Auckland, Auckland, New Zealand
Operations Research Department, Naval Postgraduate School, Monterey, California 93943
kavinesh.singh{at}gmail.com
a.philpott{at}auckland.ac.nz
kwood{at}nps.edu

We describe a multistage, stochastic, mixed-integer programming model for planning capacity expansion of production facilities. A scenario tree represents uncertainty in the model; a general mixed-integer program defines the operational submodel at each scenario-tree node, and capacity-expansion decisions link the stages. We apply "variable splitting" to two model variants, and solve those variants using Dantzig-Wolfe decomposition. The Dantzig-Wolfe master problem can have a much stronger linear programming relaxation than is possible without variable splitting, over 700% stronger in one case. The master problem solves easily and tends to yield integer solutions, obviating the need for a full branch-and-price solution procedure. For each scenario-tree node, the decomposition defines a subproblem that may be viewed as a single-period, deterministic, capacity-planning problem. An effective solution procedure results as long as the subproblems solve efficiently, and the procedure incorporates a good "duals stabilization method." We present computational results for a model to plan the capacity expansion of an electricity distribution network in New Zealand, given uncertain future demand. The largest problem we solve to optimality has six stages and 243 scenarios, and corresponds to a deterministic equivalent with a quarter of a million binary variables.

Subject classifications: facilities/equipment planning; capacity expansion; industries; electric; networks/graphs; applications; stochastic; programming; integer; algorithms; Benders decomposition; applications; stochastic.
History: Received July 2005; revision received March 2008; accepted September 2008.