The point-based robustness gap for uncertain multiobjective optimization

In robust single-objective optimization, the robustness gap is a measure of the distance between the robust optimal objective value and the optimal objective values of the scenarios. While robust multiobjective optimization is a growing field of study, no notion of a robustness gap has been proposed...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization Jg. 73; H. 6; S. 1897 - 1931
Hauptverfasser: Krüger, Corinna, Schöbel, Anita, Fritzen, Lena, Wiecek, Margaret M.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Taylor & Francis 02.06.2024
Taylor & Francis LLC
Schlagworte:
ISSN:0233-1934, 1029-4945
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In robust single-objective optimization, the robustness gap is a measure of the distance between the robust optimal objective value and the optimal objective values of the scenarios. While robust multiobjective optimization is a growing field of study, no notion of a robustness gap has been proposed. A concept of a point-based robustness gap for uncertain multiobjective optimization problems is introduced. The gap is defined as the minimal distance between the robust Pareto set and the Pareto sets of the scenarios. It is shown that the gap is zero whenever the uncertainty is constraint-wise and objective-wise, supplementing a major result about the single-objective robustness gap. Because the distance between Pareto sets is hard to compute, lower and upper bounds on the gap are constructed for convex problems. Specific results about the zero gap and the bounds are presented for linear problems. Numerical examples are included.
AbstractList In robust single-objective optimization, the robustness gap is a measure of the distance between the robust optimal objective value and the optimal objective values of the scenarios. While robust multiobjective optimization is a growing field of study, no notion of a robustness gap has been proposed. A concept of a point-based robustness gap for uncertain multiobjective optimization problems is introduced. The gap is defined as the minimal distance between the robust Pareto set and the Pareto sets of the scenarios. It is shown that the gap is zero whenever the uncertainty is constraint-wise and objective-wise, supplementing a major result about the single-objective robustness gap. Because the distance between Pareto sets is hard to compute, lower and upper bounds on the gap are constructed for convex problems. Specific results about the zero gap and the bounds are presented for linear problems. Numerical examples are included.
Author Krüger, Corinna
Schöbel, Anita
Fritzen, Lena
Wiecek, Margaret M.
Author_xml – sequence: 1
  givenname: Corinna
  surname: Krüger
  fullname: Krüger, Corinna
  organization: University of Goettingen
– sequence: 2
  givenname: Anita
  surname: Schöbel
  fullname: Schöbel, Anita
  organization: University of Goettingen
– sequence: 3
  givenname: Lena
  surname: Fritzen
  fullname: Fritzen, Lena
  organization: Clemson University
– sequence: 4
  givenname: Margaret M.
  surname: Wiecek
  fullname: Wiecek, Margaret M.
  email: wmalgor@clemson.edu
  organization: Clemson University
BookMark eNp9kEtLAzEQx4NUsFY_grDgeWsem33clKJWKHip55BsJpqyTdYkq9RP7y6tV08zDP8H87tEM-cdIHRD8JLgGt9hyhhpWLGk47akpJ6uZ2hOMG3yoin4DM0nTT6JLtBljDuMKSlpMUfr7Qdkvbcu5UpG0FnwaojJQYzZu-wz40M2uBZCktZl-6FL1qsdtMl-Qeb7ZPf2R443d4XOjewiXJ_mAr09PW5X63zz-vyyetjkLa3LlGsKmNAKGlNqXlLFdKmhAkMq0zTKaMU1N7rinNWAOdUV45IzalShas0ayhbo9pjbB_85QExi54fgxkrBMOdFVeOyGlX8qGqDjzGAEX2wexkOgmAx4RF_0MQETZygjb77o8-68fO9_Pah0yLJQ-eDCdK1dqz5P-IXsYd1yQ
Cites_doi 10.1006/jmaa.1999.6541
10.1002/mcda.1653
10.1137/130939596
10.1016/j.ejor.2007.03.048
10.1016/j.ejor.2013.02.037
10.1287/educ.2016.0153
10.1287/moor.23.4.769
10.1016/0022-247X(68)90201-1
10.1007/s00291-015-0418-7
10.1016/j.ejor.2020.09.045
10.1007/s101070100286
10.1007/978-1-4757-2827-9
10.1007/978-3-642-02886-1
10.1023/A:1021765131316
10.1016/j.ejor.2014.10.027
10.1186/1687-1812-2014-83
10.1007/BF00936168
10.1016/j.na.2016.01.002
10.1080/03052150008941314
10.1287/opre.33.5.1074
10.1016/S0167-6377(99)00016-4
10.1137/0134018
10.1063/1.2715540
10.1515/9781400831050
10.1016/j.ejor.2017.02.014
10.1007/978-3-642-50280-4
10.1016/j.ejor.2018.08.020
10.1007/s10107-018-1235-y
10.1007/s10479-017-2751-5
10.1007/s10898-017-0518-9
10.1016/j.ejor.2013.10.028
10.1137/08073682X
10.1016/j.ejor.2016.01.015
10.1007/978-1-4615-2025-2_4
10.1016/j.ejor.2021.03.068
10.1016/j.ejor.2014.03.013
10.1016/j.ejor.2018.07.035
ContentType Journal Article
Copyright 2023 Informa UK Limited, trading as Taylor & Francis Group 2023
2023 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2023 Informa UK Limited, trading as Taylor & Francis Group 2023
– notice: 2023 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.2023.2181080
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 1931
ExternalDocumentID 10_1080_02331934_2023_2181080
2181080
Genre Research Article
GrantInformation_xml – fundername: United States Office of Naval Research
  grantid: N00014-16-1-2725Resource Efficiency in Interorganizational Networks
– fundername: Resource Efficiency in Corporate Networks
  grantid: DFG RTG 1703
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
AMVHM
AQRUH
AQTUD
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-d2e0127e9f6d562b3d6de7ef17f99bfdb5d5fd75538e052d735a532fb4b8d3923
IEDL.DBID TFW
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000941913800001&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 Wed Aug 13 04:38:10 EDT 2025
Sat Nov 29 06:01:42 EST 2025
Mon Oct 20 23:46:55 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c286t-d2e0127e9f6d562b3d6de7ef17f99bfdb5d5fd75538e052d735a532fb4b8d3923
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 3055478067
PQPubID 27961
PageCount 35
ParticipantIDs proquest_journals_3055478067
informaworld_taylorfrancis_310_1080_02331934_2023_2181080
crossref_primary_10_1080_02331934_2023_2181080
PublicationCentury 2000
PublicationDate 2024-06-02
PublicationDateYYYYMMDD 2024-06-02
PublicationDate_xml – month: 06
  year: 2024
  text: 2024-06-02
  day: 02
PublicationDecade 2020
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2024
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References e_1_3_2_27_1
Berge C. (e_1_3_2_30_1) 1963
e_1_3_2_28_1
e_1_3_2_29_1
e_1_3_2_42_1
e_1_3_2_20_1
e_1_3_2_41_1
e_1_3_2_21_1
e_1_3_2_22_1
e_1_3_2_23_1
e_1_3_2_24_1
e_1_3_2_25_1
e_1_3_2_26_1
Kim NTB (e_1_3_2_36_1) 2000; 25
e_1_3_2_40_1
e_1_3_2_39_1
e_1_3_2_9_1
e_1_3_2_17_1
e_1_3_2_38_1
e_1_3_2_8_1
Ehrgott M. (e_1_3_2_16_1) 2005
e_1_3_2_18_1
e_1_3_2_7_1
e_1_3_2_19_1
Kuroiwa D (e_1_3_2_10_1) 2012; 40
e_1_3_2_2_1
e_1_3_2_31_1
e_1_3_2_33_1
e_1_3_2_11_1
e_1_3_2_32_1
e_1_3_2_6_1
e_1_3_2_12_1
e_1_3_2_35_1
e_1_3_2_5_1
e_1_3_2_13_1
e_1_3_2_34_1
e_1_3_2_4_1
e_1_3_2_14_1
e_1_3_2_37_1
e_1_3_2_3_1
e_1_3_2_15_1
References_xml – ident: e_1_3_2_26_1
  doi: 10.1006/jmaa.1999.6541
– volume: 25
  start-page: 101
  issue: 1
  year: 2000
  ident: e_1_3_2_36_1
  article-title: Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
  publication-title: Acta Math Vietnam
– ident: e_1_3_2_17_1
  doi: 10.1002/mcda.1653
– volume-title: Topological spaces: including a treatment of multi-valued functions, vector spaces and convexity
  year: 1963
  ident: e_1_3_2_30_1
– ident: e_1_3_2_8_1
  doi: 10.1137/130939596
– ident: e_1_3_2_35_1
  doi: 10.1016/j.ejor.2007.03.048
– ident: e_1_3_2_20_1
  doi: 10.1016/j.ejor.2013.02.037
– ident: e_1_3_2_4_1
  doi: 10.1287/educ.2016.0153
– volume: 40
  start-page: 305
  issue: 2
  year: 2012
  ident: e_1_3_2_10_1
  article-title: On robust multiobjective optimization
  publication-title: Vietnam J Math
– ident: e_1_3_2_14_1
  doi: 10.1287/moor.23.4.769
– ident: e_1_3_2_27_1
  doi: 10.1016/0022-247X(68)90201-1
– ident: e_1_3_2_3_1
  doi: 10.1007/s00291-015-0418-7
– ident: e_1_3_2_11_1
  doi: 10.1016/j.ejor.2020.09.045
– volume-title: Multicriteria optimization
  year: 2005
  ident: e_1_3_2_16_1
– ident: e_1_3_2_31_1
  doi: 10.1007/s101070100286
– ident: e_1_3_2_24_1
  doi: 10.1007/978-1-4757-2827-9
– ident: e_1_3_2_28_1
  doi: 10.1007/978-3-642-02886-1
– ident: e_1_3_2_39_1
  doi: 10.1023/A:1021765131316
– ident: e_1_3_2_19_1
  doi: 10.1016/j.ejor.2014.10.027
– ident: e_1_3_2_42_1
  doi: 10.1186/1687-1812-2014-83
– ident: e_1_3_2_23_1
  doi: 10.1007/BF00936168
– ident: e_1_3_2_6_1
  doi: 10.1016/j.na.2016.01.002
– ident: e_1_3_2_33_1
  doi: 10.1080/03052150008941314
– ident: e_1_3_2_37_1
  doi: 10.1287/opre.33.5.1074
– ident: e_1_3_2_15_1
  doi: 10.1016/S0167-6377(99)00016-4
– ident: e_1_3_2_25_1
  doi: 10.1137/0134018
– ident: e_1_3_2_32_1
  doi: 10.1063/1.2715540
– ident: e_1_3_2_2_1
  doi: 10.1515/9781400831050
– ident: e_1_3_2_38_1
  doi: 10.1016/j.ejor.2017.02.014
– ident: e_1_3_2_29_1
  doi: 10.1007/978-3-642-50280-4
– ident: e_1_3_2_5_1
  doi: 10.1016/j.ejor.2018.08.020
– ident: e_1_3_2_41_1
  doi: 10.1007/s10107-018-1235-y
– ident: e_1_3_2_22_1
  doi: 10.1007/s10479-017-2751-5
– ident: e_1_3_2_13_1
  doi: 10.1007/s10898-017-0518-9
– ident: e_1_3_2_7_1
  doi: 10.1016/j.ejor.2013.10.028
– ident: e_1_3_2_34_1
  doi: 10.1137/08073682X
– ident: e_1_3_2_21_1
  doi: 10.1016/j.ejor.2016.01.015
– ident: e_1_3_2_40_1
  doi: 10.1007/978-1-4615-2025-2_4
– ident: e_1_3_2_9_1
  doi: 10.1016/j.ejor.2021.03.068
– ident: e_1_3_2_12_1
  doi: 10.1016/j.ejor.2014.03.013
– ident: e_1_3_2_18_1
  doi: 10.1016/j.ejor.2018.07.035
SSID ssj0021624
Score 2.3372846
Snippet In robust single-objective optimization, the robustness gap is a measure of the distance between the robust optimal objective value and the optimal objective...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Index Database
Publisher
StartPage 1897
SubjectTerms efficient solution
minmax optimization
Multi-criteria programming
Multiple objective analysis
Pareto optimization
pareto outcome
robust optimization
Robustness
Upper bounds
Title The point-based robustness gap for uncertain multiobjective optimization
URI https://www.tandfonline.com/doi/abs/10.1080/02331934.2023.2181080
https://www.proquest.com/docview/3055478067
Volume 73
WOSCitedRecordID wos000941913800001&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 Journals Complete
  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/eLvHCXMwrV3NT8MgFCdm8aAHv43TaTh4ZbYFChyNcdnBLB6m7taUAmYmtsva-fcLlJotxnjQY0keIY_3fj-g7wOAayM0MznRiJJCI6KYQIJyl8BsqJAcF8T3Bnx-YJMJn83EY4gmrENYpbtDm7ZQhMdq59y5rLuIuBtLM9ZwsHsRSfDQcZQdtShsqd-55nT08nXlilPf1tZJICfS5fD8NMsGO23ULv2G1Z6ARvv_sPQDsBdOn_C2NZdDsKXLI7C7VpPwGIyt4cBFNS8b5BhOwWUlV3XjEBG-5gto1wotF7aRBNDHI1byrYVNWFkAeg-ZnSfgaXQ_vRuj0G4BFQlPG6QS7f5Da2FSZU9FEqtUaaZNzIwQ0ihJFTWKUQuROqKJYpjmFCdGEsmVPWbhU9Arq1KfAcgjzUmuoyImBSkkzwvGFFO51nZUENIHw07N2aKtqpHFXbHSoKLMqSgLKuoDsb4ZWeOfM0zbeyTDv8gOup3LgoNakYi6SmaWq8__MPUF2LGfxIeOJQPQa5YrfQm2i49mXi-vvCl-Aq3Z238
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDLZgIAEH3ojxzIFrRtskTXNEiGmIsdOA3aqmSdCQaKet4_eT9IE2IcQBrqkcRY7jz0ntzwBXRmhuEqoxo6nGVHGBBYtcAbNhQkYkpWVvwOc-Hwyi0Ugs1sK4tEp3hzYVUUTpq93hdo_RTUrctcUZaznEPYkEpONAyo6uwhqzWOv484fdl69Llx-WjW2dCHYyTRXPT9Ms4dMSe-k3b11CUHfnPxa_C9t1AIpuKovZgxWd7cPWAi3hAfSs7aBJPs4K7EBOoWku57PCOUX0mkyQXSyycFglE6AyJTGXb5XnRLn1Qe91cechPHXvhrc9XHdcwGkQhQVWgXa_orUwobKBkSQqVJpr43MjhDRKMsWM4sx6Se2xQHHCEkYCI6mMlI20yBG0sjzTx4AiT0c00V7q05SmMkpSzhVXidZ2VFDahk6j53hSEWvEfsNXWqsodiqKaxW1QSzuRlyULxqmaj8Sk19kz5qti-szakU85sjMLFyf_GHqS9joDR_7cf9-8HAKm_YTLTPJgjNoFdO5Pof19KMYz6YXpV1-AqIO36k
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NT8MgFCc6jdGD38bpVA5e0X5AgaNRlxmXZYepuzWlgJmJbbN1_v0Cbc0WYzzoleYR8ni834P-3nsAXGquqE6wQgSnCmFJOeKE2QRmTbhgYYpdb8DnPh0M2HjMhzWbcFbTKu0dWleFIpyvtoe7kLphxF0bmDGGE9oXkSC8shhlRlfBmgmdI2vko-7L153Lj1xfWyuCrEyTxPPTNEvwtFS89JuzdgjU3fmHte-C7Tr8hDeVveyBFZXtg62FooQHoGcsBxb5JCuRhTgJp7mYz0rrEuFrUkCzVmjAsKISQEdIzMVb5TdhbjzQe53aeQieuvej2x6q-y2gNGBRiWSg7I9oxXUkTVgkQhlJRZX2qeZcaCmIJFpSYnyk8kggaUgSEgZaYMGkibPCI9DK8kwdA8g8xXCivNTHKU4FS1JKJZWJUmaUY9wGV42a46IqqxH7TbXSWkWxVVFcq6gN-OJmxKV7z9BV85E4_EW20-xcXJ9QI-IRW8rMgPXJH6a-ABvDu27cfxg8noJN8wU7GlnQAa1yOldnYD39KCez6bmzyk8Yl95b
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=The+point-based+robustness+gap+for+uncertain+multiobjective+optimization&rft.jtitle=Optimization&rft.au=Kr%C3%BCger%2C+Corinna&rft.au=Sch%C3%B6bel%2C+Anita&rft.au=Fritzen%2C+Lena&rft.au=Wiecek%2C+Margaret+M.&rft.date=2024-06-02&rft.pub=Taylor+%26+Francis&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=73&rft.issue=6&rft.spage=1897&rft.epage=1931&rft_id=info:doi/10.1080%2F02331934.2023.2181080&rft.externalDocID=2181080
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