Cutting plane algorithms for the inverse mixed integer linear programming problem

We present cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which is to minimally perturb the objective function of a mixed integer linear program in order to make a given feasible solution optimal.

Uložené v:
Podrobná bibliografia
Vydané v:Operations research letters Ročník 37; číslo 2; s. 114 - 116
Hlavný autor: Wang, Lizhi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier B.V 01.03.2009
Elsevier
Predmet:
Applied sciences
Exact sciences and technology
Inverse optimization
Mathematical programming
Mixed integer linear programming
Operational research and scientific management
Operational research. Management science
Inverse optimization
Mixed integer linear programming
Integer programming
Linear programming
Mixed integer programming
Objective function
Cutting plane method
Optimization
Inverse problem
ISSN:0167-6377, 1872-7468
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We present cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which is to minimally perturb the objective function of a mixed integer linear program in order to make a given feasible solution optimal.
AbstractList We present cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which is to minimally perturb the objective function of a mixed integer linear program in order to make a given feasible solution optimal.
Author Wang, Lizhi
Author_xml – sequence: 1
  givenname: Lizhi
  surname: Wang
  fullname: Wang, Lizhi
  email: lzwang@iastate.edu
  organization: Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, IA 50011, USA
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21280116$$DView record in Pascal Francis
BookMark eNp9kMFq3DAQQEVJIZukH5CbLz3a1ci2JNNTWdK0sBACyVnI8nhXiy0tI2VJ_r7ebukhh5yGgfcG5l2xixADMnYLvAIO8tu-ijRVgnNdgag4h09sBVqJUjVSX7DVwqhS1kpdsquU9pxzpUGv2OP6JWcftsVhsgELO20j-bybUzFGKvIOCx-OSAmL2b_isGwZt0jF5ANaKg4Ut2Tn-e8Fiv2E8w37PNop4Zd_85o9_7x7Wv8qNw_3v9c_NqWrW51LzVWDGgUo27R9LbsGOzl2roMW6l6NtaxblHU_tNLaTjS9HRpwzdDxRru2F_U1-3q-e7DJ2WkkG5xP5kB-tvRmBAjNAeTCwZlzFFMiHP8jwM2pndmbpZ05tTMgzNJucdQ7x_lss48hk_XTh-b3s4nL60ePZJLzGBwOntBlM0T_gf0HvDWLyQ
CODEN ORLED5
CitedBy_id crossref_primary_10_1007_s10107_017_1216_6
crossref_primary_10_1016_j_ejor_2023_06_041
crossref_primary_10_1016_j_orl_2020_08_007
crossref_primary_10_1002_nav_22056
crossref_primary_10_1007_s10898_010_9637_2
crossref_primary_10_1016_j_apenergy_2010_12_022
crossref_primary_10_1016_j_trpro_2019_05_041
crossref_primary_10_1137_20M1377369
crossref_primary_10_1287_trsc_2017_0805
crossref_primary_10_3390_math8112027
crossref_primary_10_1287_opre_2021_2192
crossref_primary_10_1287_opre_2022_0382
crossref_primary_10_1016_j_disopt_2013_03_001
crossref_primary_10_1007_s10951_010_0168_y
crossref_primary_10_1016_j_orl_2018_03_007
crossref_primary_10_1287_opre_2017_1606
crossref_primary_10_1287_opre_2017_1705
crossref_primary_10_1080_02331934_2011_637111
crossref_primary_10_1016_j_tre_2014_04_004
crossref_primary_10_1155_2014_370560
crossref_primary_10_1016_j_cor_2024_106896
crossref_primary_10_1007_s10898_013_0036_3
crossref_primary_10_1016_j_asoc_2022_109018
crossref_primary_10_1287_opre_2023_0254
crossref_primary_10_1287_ijoc_2021_1138
crossref_primary_10_1016_j_compchemeng_2024_108859
crossref_primary_10_1016_j_trc_2019_07_010
crossref_primary_10_1080_23249935_2016_1189723
crossref_primary_10_1287_opre_2021_2143
crossref_primary_10_1007_s10479_018_2859_2
crossref_primary_10_1080_24725854_2022_2103755
crossref_primary_10_1287_opre_2014_1267
crossref_primary_10_1016_j_orl_2025_107251
crossref_primary_10_1111_itor_13116
crossref_primary_10_1007_s11590_021_01721_4
crossref_primary_10_1080_03155986_2025_2478699
crossref_primary_10_1287_ijoc_2022_0268
crossref_primary_10_1016_j_trb_2011_11_005
crossref_primary_10_1287_ijoc_2022_1162
crossref_primary_10_1016_j_cor_2024_106681
crossref_primary_10_1088_1361_6560_abb935
crossref_primary_10_1007_s11590_020_01683_z
crossref_primary_10_1016_j_orl_2015_08_010
crossref_primary_10_1287_trsc_2023_0241
Cites_doi 10.1287/opre.49.5.771.10607
10.1016/j.orl.2004.04.007
10.1023/B:JOCO.0000038914.26975.9b
10.1007/11496199_45
10.1016/j.orl.2005.07.009
10.1007/BF01585693
10.1016/S0893-9659(98)00151-7
ContentType Journal Article
Copyright 2008 Elsevier B.V.
2009 INIST-CNRS
Copyright_xml – notice: 2008 Elsevier B.V.
– notice: 2009 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1016/j.orl.2008.12.001
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
Applied Sciences
EISSN 1872-7468
EndPage 116
ExternalDocumentID 21280116
10_1016_j_orl_2008_12_001
S0167637708001326
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1OL
1RT
1~.
1~5
29N
4.4
457
4G.
4R4
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABAOU
ABFNM
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNCT
ACRLP
ADBBV
ADEZE
ADGUI
ADIYS
ADMUD
AEBSH
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSW
SSZ
T5K
TN5
WH7
WUQ
XPP
XSW
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c358t-8074e8e217a45b3694e96f9c91513b7f3635e63bd56aa924bad41c4d9048c5b23
ISICitedReferencesCount 57
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000264695700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-6377
IngestDate Mon Jul 21 09:12:46 EDT 2025
Sat Nov 29 02:30:14 EST 2025
Tue Nov 18 21:23:24 EST 2025
Fri Feb 23 02:30:15 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Inverse optimization
Mixed integer linear programming
Integer programming
Linear programming
Mixed integer programming
Objective function
Cutting plane method
Optimization
Inverse problem
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c358t-8074e8e217a45b3694e96f9c91513b7f3635e63bd56aa924bad41c4d9048c5b23
PageCount 3
ParticipantIDs pascalfrancis_primary_21280116
crossref_primary_10_1016_j_orl_2008_12_001
crossref_citationtrail_10_1016_j_orl_2008_12_001
elsevier_sciencedirect_doi_10_1016_j_orl_2008_12_001
PublicationCentury 2000
PublicationDate 2009-03-01
PublicationDateYYYYMMDD 2009-03-01
PublicationDate_xml – month: 03
  year: 2009
  text: 2009-03-01
  day: 01
PublicationDecade 2000
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Operations research letters
PublicationYear 2009
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Ahuja, Orlin (b3) 2001; 49
Heuberger (b4) 2004; 8
Yang, Zhang (b2) 1999; 12
Achterberg, Koch, Martin (b8) 2006; 34
Nemhauser, Wolsey (b7) 1999
Burton, Toint (b1) 1992; 53
Huang (b5) 2005
Iyengar, Kang (b6) 2005; 33
Nemhauser (10.1016/j.orl.2008.12.001_b7) 1999
Burton (10.1016/j.orl.2008.12.001_b1) 1992; 53
Ahuja (10.1016/j.orl.2008.12.001_b3) 2001; 49
Yang (10.1016/j.orl.2008.12.001_b2) 1999; 12
Heuberger (10.1016/j.orl.2008.12.001_b4) 2004; 8
Huang (10.1016/j.orl.2008.12.001_b5) 2005
Iyengar (10.1016/j.orl.2008.12.001_b6) 2005; 33
Achterberg (10.1016/j.orl.2008.12.001_b8) 2006; 34
References_xml – volume: 49
  start-page: 771
  year: 2001
  end-page: 783
  ident: b3
  article-title: Inverse optimization
  publication-title: Operations Research
– volume: 33
  start-page: 319
  year: 2005
  end-page: 330
  ident: b6
  article-title: Inverse conic programming with applications
  publication-title: Operations Research Letters
– volume: 12
  start-page: 69
  year: 1999
  end-page: 72
  ident: b2
  article-title: Two general methods for inverse optimization problems
  publication-title: Applied Mathematics Letters
– year: 1999
  ident: b7
  article-title: Integer and Combinatorial Optimization
– volume: 53
  start-page: 45
  year: 1992
  end-page: 61
  ident: b1
  article-title: On an instance of the inverse shortest paths problem
  publication-title: Mathematical Programming
– volume: 8
  start-page: 329
  year: 2004
  end-page: 361
  ident: b4
  article-title: Inverse combinatorial optimization: A survey on problems, methods, and results
  publication-title: Journal of Combinatorial Optimization
– start-page: 422
  year: 2005
  end-page: 426
  ident: b5
  article-title: Inverse problems of some NP-complete problems
  publication-title: Algorithmic Applications in Management
– volume: 34
  start-page: 361
  year: 2006
  end-page: 372
  ident: b8
  article-title: MIPLIB 2003
  publication-title: Operations Research Letters
– volume: 49
  start-page: 771
  issue: 5
  year: 2001
  ident: 10.1016/j.orl.2008.12.001_b3
  article-title: Inverse optimization
  publication-title: Operations Research
  doi: 10.1287/opre.49.5.771.10607
– volume: 33
  start-page: 319
  year: 2005
  ident: 10.1016/j.orl.2008.12.001_b6
  article-title: Inverse conic programming with applications
  publication-title: Operations Research Letters
  doi: 10.1016/j.orl.2004.04.007
– year: 1999
  ident: 10.1016/j.orl.2008.12.001_b7
– volume: 8
  start-page: 329
  year: 2004
  ident: 10.1016/j.orl.2008.12.001_b4
  article-title: Inverse combinatorial optimization: A survey on problems, methods, and results
  publication-title: Journal of Combinatorial Optimization
  doi: 10.1023/B:JOCO.0000038914.26975.9b
– start-page: 422
  year: 2005
  ident: 10.1016/j.orl.2008.12.001_b5
  article-title: Inverse problems of some NP-complete problems
  publication-title: Algorithmic Applications in Management
  doi: 10.1007/11496199_45
– volume: 34
  start-page: 361
  year: 2006
  ident: 10.1016/j.orl.2008.12.001_b8
  article-title: MIPLIB 2003
  publication-title: Operations Research Letters
  doi: 10.1016/j.orl.2005.07.009
– volume: 53
  start-page: 45
  year: 1992
  ident: 10.1016/j.orl.2008.12.001_b1
  article-title: On an instance of the inverse shortest paths problem
  publication-title: Mathematical Programming
  doi: 10.1007/BF01585693
– volume: 12
  start-page: 69
  year: 1999
  ident: 10.1016/j.orl.2008.12.001_b2
  article-title: Two general methods for inverse optimization problems
  publication-title: Applied Mathematics Letters
  doi: 10.1016/S0893-9659(98)00151-7
SSID ssj0007818
Score 2.1293168
Snippet We present cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which is to minimally perturb the objective function of...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 114
SubjectTerms Applied sciences
Exact sciences and technology
Inverse optimization
Mathematical programming
Mixed integer linear programming
Operational research and scientific management
Operational research. Management science
Title Cutting plane algorithms for the inverse mixed integer linear programming problem
URI https://dx.doi.org/10.1016/j.orl.2008.12.001
Volume 37
WOSCitedRecordID wos000264695700012&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7468
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007818
  issn: 0167-6377
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fa9RAEF609UERsVWxVcs--KAekUuyu9l9LKWiIlWx4r2F3WTjpVxzIXcth3-9s5lNLmexqOBLOMLl53yZfDOZ-YaQ5xkzkdUhD4RWecAMxCnSWh0YHtkwL4Cij3U7bCI5OZGTifrkh3Eu2nECSVXJ1UrV_9XUsA6M7Vpn_8Lc_U5hBfwGo8MSzA7LPzL80QWWMteujHWkZ9_nEP9PUXehpZll5Uox7Oi8XNkc9SJsM3J008leY73WOTapt8Nmhvz1Y20bXzznZYKmo1nbEdRz828-A_2h_DEtN5IKal1VhZmuK90umHwEpypiP3bFosOUCTB0hqNxOo-KMi4eOdHAPYbYMOrftCF2WV5x4phPOHs9b2ZY7Orytf7sNrWxv7hTcmfkeC_E1eIm2Y4SrsC9bR--O56871_KiWxTvf0ldB-421K_Xw70O4pyt9YLeHAKnHgyoCGn98k9Hz_QQ7T7Drlhq11yZ6AquUt2vL9e0BdeVPzlA_LZw4K2sKBrWFCABQVYUA8L2sKCelhQhAUdwIJ6WDwkX98cnx69Dfw4jSCLuVw62WlmpYUYVDNuYqGYVaJQmQLSF5ukiIF7WhGbnAutISw3OmdhxnIFTj7jJoofka1qXtnHhI6FBGqXGBaGBTOSK6ElH0dWJlbogid7ZNzdwTTzWvNu5Mks7YoKz1K46TgDNYxcYeUeedVvUqPQynV_Zp1ZUs8UkQGmgKHrNjvYMGF_IOBv0n2R3P-3_T4ht9cP0VOytWwu7DNyK7tclovmwEPxJyGjmBo
linkProvider Elsevier
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=Cutting+plane+algorithms+for+the+inverse+mixed+integer+linear+programming+problem&rft.jtitle=Operations+research+letters&rft.au=Wang%2C+Lizhi&rft.date=2009-03-01&rft.pub=Elsevier+B.V&rft.issn=0167-6377&rft.eissn=1872-7468&rft.volume=37&rft.issue=2&rft.spage=114&rft.epage=116&rft_id=info:doi/10.1016%2Fj.orl.2008.12.001&rft.externalDocID=S0167637708001326
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon