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 2007
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2007
  • 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 2007
  • View Item
  • edoc-Server Home
  • Elektronische Zeitschriften
  • Stochastic Programming E-print Series (SPEPS)
  • Volume 2007
  • View Item
2007-07-04Buch DOI: 10.18452/8379
Computations with Disjunctive Cuts for Two-Stage Stochastic Mixed 0-1 Integer Programs
Ntaimo, Lewis
Tanner, Matthew W.
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computationalstudy of a disjunctive cutting plane method for stochastic mixed 0-1 programsthat uses lift-and-project cuts based on the extensive form of the two-stage SMIPproblem. An extension of the method based on where the data uncertainty appearsin the problem is made, and it is shown how a valid inequality derived for onescenario can be made valid for other scenarios, potentially reducing solution time.Computational results amply demonstrate the effectiveness of disjunctive cuts insolving several large-scale problem instances from the literature. The results arecompared to the computational results of disjunctive cuts based on the subproblemspace of the formulation and it is shown that the two methods are equivalentlyeffective on the test instances.
Files in this item
Thumbnail
7.pdf — Adobe PDF — 229.0 Kb
MD5: 42b3aafa99bf31bb267b3eb34fc22d71
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/8379
Permanent URL
https://doi.org/10.18452/8379
HTML
<a href="https://doi.org/10.18452/8379">https://doi.org/10.18452/8379</a>