Date of Original Version
This is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version is available at http://dx.doi.org/10.1016/j.compchemeng.2013.11.011
Abstract or Description
In this paper, we present a new decomposition algorithm for solving large-scale multistage stochastic programs (MSSPs) with endogenous uncertainties. Instead of dualizing all the initial non-anticipativity constraints (NACs) and removing all the conditional NACs to decompose the problem into scenario subproblems, the basic idea relies on keeping a subset of NACs as explicit constraints in the scenario group subproblems while dualizing or relaxing the rest of the NACs. It is proved that the algorithm provides a dual bound that is at least as tight as the standard approach. Numerical results for process network examples and oilfield development planning problem are presented to illustrate that the proposed decomposition approach yields significant improvement in the dual bound at the root node and reduction in the total computational expense for closing the gap.
Computers and Chemical Engineering, 62, 62-79.