Logo of Humboldt-Universität zu BerlinLogo of Humboldt-Universität zu Berlin
edoc-Server
Open-Access-Publikationsserver der Humboldt-Universität
de|en
Header image: facade of Humboldt-Universität zu Berlin
View Item 
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2000
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2000
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
View Item 
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2000
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2000
  • View Item
2000-12-19Buch DOI: 10.18452/8250
The C 3 theorem and a D 2 algorithm for large scale stochastic integer programming
Set convexification
Sen, Suvrajeet
Higle, Julia L.
This paper considers the two stage stochastic integer programming problems, with an emphasis on problems 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 great deal in common. We refer to this characterization as the C^3 (Common Cut Coefficients) Theorem. Based on the C^3 Theorem, we develop an algorithmic methodology that we refer to as Disjunctive Decomposition (D^2). We show that when the second stage consists of 0-1 MILP problems , we can obtain accurate second stage objective function estimates afer finitely many steps. We also set the stage for comparisions between problems in which the first stage includes only 0-1 variables and those that allow both continuous and integer variables in the first stage.
Files in this item
Thumbnail
26.pdf — Adobe PDF — 658.3 Kb
MD5: 3aeac718dbea724c7b3260525baf2b4f
26.ps — Postscript — 273.8 Kb
MD5: 8a45279f716351e0af8b86d5e1ac32b3
Cite
BibTeX
EndNote
RIS
InCopyright
Details
DINI-Zertifikat 2019OpenAIRE validatedORCID Consortium
Imprint Policy Contact Data Privacy Statement
A service of University Library and Computer and Media Service
© Humboldt-Universität zu Berlin
 
DOI
10.18452/8250
Permanent URL
https://doi.org/10.18452/8250
HTML
<a href="https://doi.org/10.18452/8250">https://doi.org/10.18452/8250</a>