Hyperrectangular partition schemes for two-stage stochastic linear mixed integer programming problems

A new exact algorithm is developed in this paper for solving two-stage stochastic linear mixed integer programming problems with pure integer variables in the first stage and continuous variables in the second stage. By combining Benders' decomposition method with hyperrectangular cut and parti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization Ročník 74; číslo 16; s. 4207 - 4222
Hlavní autor: Wang, Fenlan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Taylor & Francis 10.12.2025
Taylor & Francis LLC
Témata:
Benders decomposition
hyperrectangular partition
Integer programming
Mixed integer
optimality gap
Optimization
Two-stage stochastic mixed integer programs
ISSN:0233-1934, 1029-4945
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A new exact algorithm is developed in this paper for solving two-stage stochastic linear mixed integer programming problems with pure integer variables in the first stage and continuous variables in the second stage. By combining Benders' decomposition method with hyperrectangular cut and partition technique, we can cut off some hyperrectangulars where there is no optimal solution of the original problem. Integrating such solution scheme into a branch-and-bound framework, the proposed solution method reduces the optimality gap successively in the solution iterations. Furthermore, the proposed solution method can find the optimal solution within a finite number of iterations. The computational results show the solution method is promising.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2024.2400338