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!
Abstract 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.
AbstractList 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.
Author Wang, Fenlan
Author_xml – sequence: 1
  givenname: Fenlan
  surname: Wang
  fullname: Wang, Fenlan
  email: flwang@nuaa.edu.cn
  organization: Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles (NUAA), MIIT
BookMark eNp9kE1LAzEQhoNUsH78BGHB89ZJsp83RdQKBS96Dml2sk3ZTWqSUvvvzVK9epmZw_vOO_Nckpl1Fgm5pbCg0MA9MM5py4sFA5ZKAcB5c0bmFFibF21Rzsh80uST6IJchrAFYLRixZzg8rhD71FFafv9IH22kz6aaJzNgtrgiCHTzmfx4PIQZY9ZiE5tZIhGZYOxmByj-cYuMzZij8nvXe_lOBrbT_N6wDFck3Mth4A3v_2KfL48fzwt89X769vT4ypXrKliXtalxlbXJWC91um-tVY1b7sGtQbQdUH5uuNFV4LkTQXQlRVSBVoirbr0M78id6e9KfhrjyGKrdt7myIFZzWnrG5KnlTlSaW8C8GjFjtvRumPgoKYiIo_omIiKn6JJt_DyWdsQjLKg_NDJ6I8Ds5rL60yKeb_FT_WJYDf
Cites_doi 10.1080/00207160.2017.1418505
10.1016/0167-6377(93)90002-X
10.1080/01605682.2020.1784047
10.1016/S0167-6377(98)00050-9
10.1016/j.orl.2013.02.003
10.1007/s10107-006-0724-6
10.1137/140967337
10.1007/BF02680570
10.1137/040606193
10.1007/BF00121682
10.1137/17M1148189
10.1287/ijoc.2016.0717
10.1007/s10589-007-9113-1
10.1287/trsc.28.2.95
10.1007/BF01585566
10.1137/13092678X
ContentType Journal Article
Copyright 2024 Informa UK Limited, trading as Taylor & Francis Group 2024
2024 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2024 Informa UK Limited, trading as Taylor & Francis Group 2024
– notice: 2024 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
DOI 10.1080/02331934.2024.2400338
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Aerospace Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4945
EndPage 4222
ExternalDocumentID 10_1080_02331934_2024_2400338
2400338
Genre Research Article
GrantInformation_xml – fundername: the National Natural Science Foundation of China
  grantid: 12071215
GroupedDBID .7F
.DC
.QJ
0BK
0R~
123
29N
30N
4.4
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DKSSO
DU5
EBS
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c286t-575fe9f750e7bf624bfc739d8eff00f7413bd34d50a38600d56e1c0fae16d3383
IEDL.DBID TFW
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001306207600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0233-1934
IngestDate Thu Nov 20 05:10:52 EST 2025
Thu Nov 27 01:06:09 EST 2025
Thu Nov 20 04:10:23 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 16
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c286t-575fe9f750e7bf624bfc739d8eff00f7413bd34d50a38600d56e1c0fae16d3383
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 3273127853
PQPubID 27961
PageCount 16
ParticipantIDs crossref_primary_10_1080_02331934_2024_2400338
informaworld_taylorfrancis_310_1080_02331934_2024_2400338
proquest_journals_3273127853
PublicationCentury 2000
PublicationDate 2025-12-10
PublicationDateYYYYMMDD 2025-12-10
PublicationDate_xml – month: 12
  year: 2025
  text: 2025-12-10
  day: 10
PublicationDecade 2020
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2025
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References van der Laan N (e_1_3_3_10_1) 2023
e_1_3_3_7_1
e_1_3_3_6_1
e_1_3_3_9_1
e_1_3_3_8_1
e_1_3_3_18_1
e_1_3_3_17_1
e_1_3_3_14_1
e_1_3_3_13_1
e_1_3_3_16_1
e_1_3_3_15_1
e_1_3_3_3_1
e_1_3_3_2_1
e_1_3_3_5_1
e_1_3_3_12_1
e_1_3_3_4_1
e_1_3_3_11_1
References_xml – ident: e_1_3_3_17_1
  doi: 10.1080/00207160.2017.1418505
– ident: e_1_3_3_11_1
  doi: 10.1016/0167-6377(93)90002-X
– ident: e_1_3_3_18_1
  doi: 10.1080/01605682.2020.1784047
– ident: e_1_3_3_5_1
  doi: 10.1016/S0167-6377(98)00050-9
– ident: e_1_3_3_7_1
  doi: 10.1016/j.orl.2013.02.003
– ident: e_1_3_3_12_1
  doi: 10.1007/s10107-006-0724-6
– ident: e_1_3_3_14_1
  doi: 10.1137/140967337
– ident: e_1_3_3_9_1
  doi: 10.1007/BF02680570
– start-page: 1
  year: 2023
  ident: e_1_3_3_10_1
  article-title: A converging Benders' decomposition algorithm for two-stage mixed-integer recourse models
  publication-title: Oper Res
– ident: e_1_3_3_15_1
  doi: 10.1137/040606193
– ident: e_1_3_3_2_1
  doi: 10.1007/BF00121682
– ident: e_1_3_3_6_1
  doi: 10.1137/17M1148189
– ident: e_1_3_3_8_1
  doi: 10.1287/ijoc.2016.0717
– ident: e_1_3_3_16_1
  doi: 10.1007/s10589-007-9113-1
– ident: e_1_3_3_3_1
  doi: 10.1287/trsc.28.2.95
– ident: e_1_3_3_4_1
  doi: 10.1007/BF01585566
– ident: e_1_3_3_13_1
  doi: 10.1137/13092678X
SSID ssj0021624
Score 2.3810842
Snippet 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...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Index Database
Publisher
StartPage 4207
SubjectTerms Benders decomposition
hyperrectangular partition
Integer programming
Mixed integer
optimality gap
Optimization
Two-stage stochastic mixed integer programs
Title Hyperrectangular partition schemes for two-stage stochastic linear mixed integer programming problems
URI https://www.tandfonline.com/doi/abs/10.1080/02331934.2024.2400338
https://www.proquest.com/docview/3273127853
Volume 74
WOSCitedRecordID wos001306207600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1029-4945
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021624
  issn: 0233-1934
  databaseCode: TFW
  dateStart: 19850101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0ShIA-shiRO8xgRoupUMRTRLUrsO-jQh5rw-PncJQ4qQogBlmxnWXdn3_dZl--EuKSc0ZbKhqIEMSyqHagiQiCqwgXFS8FCWA-biEejZDJJ7103YenaKplDYyMUUd_VfLjzomw74q6pzFDiaH4RCegT8jwy_t2XkD3n-Hjw-Em5_Kgea8sWik3af3h-WuVLdfqiXfrtrq4L0GD3H7a-J3Yc-pQ3Tbrsiw2YH4jtNU3CQwFDYqYrvgf5JZN4r1xydnH8JDFhmEEpab-yelsoQpZPIAk-muec9Z4l74gsZtN3sLJWogCyb1rAZrS8dPNryiPxMLgb3w6Vm8WgTJBElSJUh5Ai4QuICySvFmhindoEED0PCZfowurQ9r1cJwSibD8C33iYgx9ZpsHHojNfzOFESI2hTjBEjA3BoQhyJsaxl3pGE1z0-11x1cYgWzaSG5nfKpk6_2Xsv8z5ryvS9UhlVf3Wgc1gkkz_Yttrw5q500smhOn8ICYkc_qHpc_EVsDDgv2Aal1PdKrVC5yLTfNaTcvVRZ2nH9pC5Gs
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDLZgIAEH3ojBgBy4FtqmzyNCTEOMnYbgFrWpAzvsoa08fj52H2gTQhzg0pujyHbi77PSzwDnlDMyo7JhUYJoFtV2rTQwSFSFC4odY4ZeMWwi7PWip6d4_l8YflbJHNqUQhHFXc2Hm5vR9ZO4S6ozlDmSWyIufTweSBYtw4pPtZaf9fXbj1-kywmKwbZsYrFN_RfPT8ss1KcF9dJvt3VRgtpb_7H5bdisAKi4KjNmB5ZwtAsbc7KEe4AdIqdTvgq5mUnUV0w4wTiEgsgwDnEmaMMifx9bBC6fURCC1C8JSz4L3hJZDAcfmIlCjALJvnwFNqTlRTXCZrYPD-2b_nXHqsYxWNqNgtwiYGcwNgQxMEwNuTU1OpRxFqExtm0Imsg0k17m24mMCEdlfoCOtk2CTpAxEz6Axmg8wkMQ0ngyMp4xoSZEFGDC3Di0Y1tLQoyO34SLOghqUqpuKKcWM638p9h_qvJfE-L5UKm8aHeYcjaJkr_Ytuq4quoAkwnBOscNCcwc_WHpM1jr9O-7qnvbuzuGdZdnBzsulb4WNPLpK57Aqn7LB7PpaZG0n0Ms6Iw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIAQDb0ShgAfWQBKneYwIiIpAVYciukWJfYYOfagJj5_PXeKgVggxwJLtLOvu7Ps-6_IdY-eYM0Jh2bAwQSSJartW5mtAqkIFxY5AgVcOmwi63XAwiHqmmzA3bZXEoXUlFFHe1XS4p0rXHXGXWGYwcQS9iLj48WgeWbjMVkpxLEzpfvz0xbkcv5xrSyYW2dQ_8fy0zEJ5WhAv_XZZlxUo3vqHvW-zTQM_-VWVLztsCca7bGNOlHCPQQep6YwuQnrKROLLp5ReFECOVBhGkHPcLy_eJxZCy2fgiB_lS0qCz5x2hBaj4QcoXkpRANpXPWAjXJ6bATb5PnuMb_vXHcsMY7CkG_qFhbBOQ6QRYECQafRqpmUgIhWC1ratEZiITAlPte1UhIiiVNsHR9o6BcdXxIMPWGM8GcMh40J7ItSe1oFEPORDSsw4sCNbCsSLTrvJLuoYJNNKcyNxailT47-E_JcY_zVZNB-ppCgfO3Q1mSQRv9i26rAm5viiCYI6xw0Qyhz9Yekztta7iZOHu-79MVt3aXCw42Lda7FGMXuFE7Yq34phPjstU_YTcIjnMA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Hyperrectangular+partition+schemes+for+two-stage+stochastic+linear+mixed+integer+programming+problems&rft.jtitle=Optimization&rft.au=Wang%2C+Fenlan&rft.date=2025-12-10&rft.pub=Taylor+%26+Francis&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=74&rft.issue=16&rft.spage=4207&rft.epage=4222&rft_id=info:doi/10.1080%2F02331934.2024.2400338&rft.externalDocID=2400338
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0233-1934&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0233-1934&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0233-1934&client=summon