Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems

Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems

0.00 Avg rating0 Votes
Article ID: iaor200971643
Country: United States
Volume: 57
Issue: 5
Start Page Number: 1271
End Page Number: 1286
Publication Date: Sep 2009
Journal: Operations Research
Authors: , ,
Keywords: production, programming: integer
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.