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 2009
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2009
  • 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 2009
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2009
  • View Item
2009-05-22Buch DOI: 10.18452/8402
Fenchel Decomposition for Stochastic Mixed-IntegerProgramming
Ntaimo, L.
This paper introduces a new cutting plane method for two-stage stochastic mixed-integer programming (SMIP) called Fenchel decomposition (FD). FD usesa class of valid inequalities termed, FD cuts, which are derived based on Fenchel cutting planes from integer programming. We derive FD cuts based on both the first and second stage variables, and devise an FD algorithm for SMIP with binary first stage and establish finite convergence for mixed-binary second stage. We also derive alternative FD cuts based on the second stage variables only and use an idea from disjunctive programming to lift the cuts to the higher dimension space including the first stage variables. We then devise an FD-L algorithm based on the lifted FD cuts. Finally, we report on preliminary computational results based on example instances from the literature. The results are promising and show the lifted FD cuts to have better performance than the regular FD cuts. Furthermore, both the FD and FD-L algorithms outperform a standard solver on large-scaleinstances.
Files in this item
Thumbnail
4.pdf — Adobe PDF — 203.7 Kb
MD5: 1252ba35c1788f563643c9222f76f1d0
Notes
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/8402
Permanent URL
https://doi.org/10.18452/8402
HTML
<a href="https://doi.org/10.18452/8402">https://doi.org/10.18452/8402</a>