A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit <a rel="external noopener" href="http://ise.tamu.edu/people/faculty/Ntaimo/personal_web/Papers/c3d2_022104.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification
<span title="2005-04-28">2005</span>
<i title="Springer Nature">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o653fqsowvcyrhw6p4gdmpdkwm" style="color: black;">Mathematical programming</a>
</i>
Preserved Fulltext
This paper considers the two-stage stochastic integer programming problem, with an emphasis on instances in which integer variables appear in the second stage. Drawing heavily on the theory of disjunctive programming, we characterize convexifications of the second stage problem and develop a decomposition-based algorithm for the solution of such problems. In particular, we verify that problems with fixed recourse are characterized by scenario-dependent second stage convexifications that have a
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-004-0566-z">doi:10.1007/s10107-004-0566-z</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bc5wkdl2l5adxeybhg5aievady">fatcat:bc5wkdl2l5adxeybhg5aievady</a>
</span>
more »
... reat deal in common. We refer to this characterization as the C 3 (Common Cut Coefficients) Theorem. Based on the C 3 Theorem, we develop a decomposition algorithm which we refer to as Disjunctive Decomposition (D 2 ). In this new class of algorithms, we work with master and subproblems that result from convexifications of two coupled disjunctive programs. We show that when the second stage consists of 0-1 MILP problems, we can obtain accurate second stage objective function estimates after finitely many steps. This result implies the convergence of the D 2 algorithm.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060912000346/http://ise.tamu.edu/people/faculty/Ntaimo/personal_web/Papers/c3d2_022104.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/ca/85/ca85bec64b689f437b06473a35a0672bd6798d14.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-004-0566-z">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>