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 2006
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2006
  • 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 2006
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2006
  • View Item
2006-10-27Buch DOI: 10.18452/8366
A branch-and-cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variables
Ntaimo, Lewis
Sen, Suvrajeet
This paper presents a branch-and-cut method for two-stage stochastic mixed-integer programming (SMIP) problems with continuous first-stage variables. This method is derived based on disjunctive decomposition(D2) for SMIP, an approach in which disjunctive programming is used to derive valid inequalities for SMIP. The novelty of the proposed method derives from branching on the first-stage continuous domain while the branch-and-bound process is guided by the disjunction variables in the second-stage.Finite convergence of the algorithm for mixed-binary second-stage is established and a numerical example to illustrate the new method is given.Keywords: stochastic programming, disjunctive decomposition, branch-and-bound, branch-and-cut
Files in this item
Thumbnail
17.pdf — Adobe PDF — 313.2 Kb
MD5: a69ded05e440f25b71e76fd7ec725698
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/8366
Permanent URL
https://doi.org/10.18452/8366
HTML
<a href="https://doi.org/10.18452/8366">https://doi.org/10.18452/8366</a>