A Summary and Illustration of Disjunctive Decomposition with Set Convexification
Book
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
In this paper we review the Disjunctive Decomposition (D2) algorithm for two-stage Stochastic Mixed Integer Programs (SMIP). This novel method uses principles of disjunctive programming to develop cuttingplane-based approximations of the feasible set of the second stage problem. At the core of this approach is the Common Cut Coefficient Theorem, which provides a mechanism for transforming cuts derived for one outcome of the second stage problem into cuts that are valid for other outcomes. An illustrative application of the D2 method to the solution of a small SMIP illustrative example is provided.