Redundancy and delimitation of the Pareto front Redundancy and delimitation of the Pareto front

The purpose of this paper is to investigate the constraints shaping the Pareto front in multi-objective linear programming, by applying recently proposed single-objective optimization methods to individual linear programming problems, constructed from the given problem. Considering the binding const...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operational research Jg. 25; H. 3; S. 87
1. Verfasser: Nikolakakou, Christina D.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2025
Springer Nature B.V
Schlagworte:
Algorithms
Binding
Business and Management
Computational Intelligence
Constraints
Decision making
Intersections
Linear programming
Management Science
Multiple objective analysis
Operations Research
Operations Research/Decision Theory
Optimization techniques
Pareto optimum
Redundancy
Review Article
PRMac algorithm
Pareto front
Minimal Multiobjective Linear Programming Problem
Multiobjective Linear Programming
Binding constraints
Cosine algorithm
ISSN:1109-2858, 1866-1505
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The purpose of this paper is to investigate the constraints shaping the Pareto front in multi-objective linear programming, by applying recently proposed single-objective optimization methods to individual linear programming problems, constructed from the given problem. Considering the binding constraints of these individual linear programming problems, two new constraint sets are proposed, called union-binding and intersection-binding. A definition of binding constraints for a multiobjective problem is given and it is proved that at least the constraints that belonging to the union-binding set are binding constraints for the given multi-objective problem. Furthermore, it is proved that if the intersection-binding set is non-empty, then at least one point resulting from strictly satisfying these constraints belongs to the Pareto set. Hence, the exploration of union-binding and intersection-binding sets facilitates an understanding of both the constraints contributing to finding the Pareto set and those delimiting the Pareto front. Additionally, we interpret the union-binding and intersection-binding sets, using interpretive parameter variables derived from the original multi-objective problem, through a parallel exploitation of recently proposed LP algorithms, PRMac and Cosine. This interpretation leads to the conclusion that exploiting union-binding and intersection-binding sets holds promising prospects for future research. Finally, the present paper defines the minimal multi-objective linear programming problem and proposes a step-by-step solution for the multi-objective problem.
AbstractList The purpose of this paper is to investigate the constraints shaping the Pareto front in multi-objective linear programming, by applying recently proposed single-objective optimization methods to individual linear programming problems, constructed from the given problem. Considering the binding constraints of these individual linear programming problems, two new constraint sets are proposed, called union-binding and intersection-binding. A definition of binding constraints for a multiobjective problem is given and it is proved that at least the constraints that belonging to the union-binding set are binding constraints for the given multi-objective problem. Furthermore, it is proved that if the intersection-binding set is non-empty, then at least one point resulting from strictly satisfying these constraints belongs to the Pareto set. Hence, the exploration of union-binding and intersection-binding sets facilitates an understanding of both the constraints contributing to finding the Pareto set and those delimiting the Pareto front. Additionally, we interpret the union-binding and intersection-binding sets, using interpretive parameter variables derived from the original multi-objective problem, through a parallel exploitation of recently proposed LP algorithms, PRMac and Cosine. This interpretation leads to the conclusion that exploiting union-binding and intersection-binding sets holds promising prospects for future research. Finally, the present paper defines the minimal multi-objective linear programming problem and proposes a step-by-step solution for the multi-objective problem.
ArticleNumber 87
Author Nikolakakou, Christina D.
Author_xml – sequence: 1
  givenname: Christina D.
  orcidid: 0000-0002-4841-0397
  surname: Nikolakakou
  fullname: Nikolakakou, Christina D.
  email: gnikolakak@uop.gr
  organization: Department of Digital Systems, University of the Peloponnese
BookMark eNp9kEtLAzEUhYNUsNb-AVcDrsfeJJNMZinFFxQU0XXIa3RKm9Qks-i_NzqCO-_mnMU558J3jmY-eIfQJYZrDNCuEiaU4RoIqwE6zmt-guZYFIMZsFnxGLqaCCbO0DKlLZSjpBWNmKPVi7Ojt8qbY6W8razbDfshqzwEX4W-yh-uelbR5VD1Mfh8gU57tUtu-asL9HZ3-7p-qDdP94_rm01tKOa51qbVhpuedFZrI8CKzhHX6YbgptHEgu6EMT30BKtGgObM2taCazRmlDWGLtDVtHuI4XN0KcttGKMvLyUltIUWc-hKikwpE0NK0fXyEIe9ikeJQX6zkRMbWdjIHzaSlxKdSqmE_buLf9P_tL4AX8NnuQ
Cites_doi 10.1016/j.asr.2024.06.002
10.1016/j.amc.2014.11.080
10.4236/ajor.2023.136010
10.1007/BF03398681
10.1007/s00158-003-0368-6
10.3390/app15105732
10.1007/s00170-004-2278-1
10.1080/09720502.2007.10700521
10.1007/BF01720315
10.1016/j.ejor.2009.03.020
10.1007/BF00933152
10.1080/00207160.2014.907403
10.1145/3503823.3503848
10.1109/TII.2022.3211853
10.1142/9789811293009_0028
10.1016/0377-2217(95)00340-1
10.4018/978-1-4666-5888-2.ch346
10.1080/02522667.2014.996031
10.1109/TAES.2024.3404915
10.1145/3437120.3437320
10.1162/106365603322519297
10.1016/S0377-2217(99)00139-3
10.1016/j.ymssp.2021.108386
10.1201/9781315139470
10.1016/j.swevo.2024.101584
10.1155/2010/723402
10.1007/978-1-4615-5563-6
10.1016/0377-2217(77)90025-X
10.1162/evco.2009.17.2.135
10.1007/978-3-540-69995-8_68
10.1057/jors.1975.152
10.1016/0377-2217(92)90083-L
10.1002/pamm.200700561
10.1007/978-3-319-21091-9
10.1016/j.actaastro.2024.06.002
10.1007/11844297_54
10.1145/3575879.3575990
ContentType Journal Article
Copyright The Author(s) 2025
The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2025
– notice: The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID C6C
AAYXX
CITATION
7TB
8FD
FR3
KR7
DOI 10.1007/s12351-025-00966-6
DatabaseName Springer Nature OA Free Journals
CrossRef
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Civil Engineering Abstracts
DatabaseTitle CrossRef
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Mechanical & Transportation Engineering Abstracts
DatabaseTitleList
Civil Engineering Abstracts
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1866-1505
ExternalDocumentID 10_1007_s12351_025_00966_6
GrantInformation_xml – fundername: University of Peloponnese
GroupedDBID .VR
06D
0R~
123
1N0
203
29N
2J2
2JN
2JY
2KG
2KM
2LR
30V
4.4
406
408
40D
40E
5VS
67Z
6NX
7WY
875
8FL
8TC
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYZH
ABAKF
ABBRH
ABDBE
ABDZT
ABECU
ABFSG
ABFTV
ABHQN
ABJNI
ABJOX
ABKCH
ABMNI
ABMQK
ABNWP
ABQBU
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABWNU
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACPIV
ACSNA
ACSTC
ACZOJ
ADHHG
ADHIR
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHPBZ
AHWEU
AHYZX
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ATHPR
AXYYD
AYFIA
AYQZM
B-.
BA0
BAPOH
BENPR
BGNMA
C6C
CS3
CSCUP
DDRTE
DNIVK
DPUIP
EBLON
EBS
EIOEI
ESBYG
FERAY
FFXSO
FIGPU
FNLPD
FRRFC
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
HCIFZ
HF~
HG6
HLICF
HMJXF
HRMNR
IKXTQ
IWAJR
IXD
I~X
I~Z
J-C
J0Z
JBSCW
JZLTJ
K60
K6~
KOV
LLZTM
M4Y
MA-
NPVJJ
NQJWS
NU0
O93
O9G
O9J
P9M
PF0
PT4
QOS
R89
R9I
ROL
RPX
RSV
S16
S1Z
S27
S3B
SAP
SBE
SDH
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W48
WK8
YLTOR
Z45
ZMTXR
~A9
-Y2
0VY
2VQ
8FE
8FG
AARHV
AAYTO
AAYXX
ABJCF
ABULA
ABUWG
ACBXY
AEBTG
AFFHD
AFGCZ
AFKRA
AHSBF
AIAKS
AJBLW
BDATZ
BEZIV
BGLVJ
BPHCQ
CAG
CCPQU
CITATION
COF
DWQXO
EJD
FINBP
FRNLG
FSGXE
H13
HZ~
K8~
L6V
M0C
M7S
O9-
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
Q2X
7TB
8FD
FR3
KR7
ID FETCH-LOGICAL-c316t-bc7bc6cf29dbbc80d89e2e9b42144b2d0b98ccf0f21a480b65dd7d0e4b15354c3
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001545133500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1109-2858
IngestDate Wed Nov 05 08:21:25 EST 2025
Sat Nov 29 07:21:52 EST 2025
Tue Sep 30 01:10:32 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords PRMac algorithm
Pareto front
Minimal Multiobjective Linear Programming Problem
Multiobjective Linear Programming
Binding constraints
Cosine algorithm
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c316t-bc7bc6cf29dbbc80d89e2e9b42144b2d0b98ccf0f21a480b65dd7d0e4b15354c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-4841-0397
OpenAccessLink https://link.springer.com/10.1007/s12351-025-00966-6
PQID 3237071609
PQPubID 326268
ParticipantIDs proquest_journals_3237071609
crossref_primary_10_1007_s12351_025_00966_6
springer_journals_10_1007_s12351_025_00966_6
PublicationCentury 2000
PublicationDate 2025-09-01
PublicationDateYYYYMMDD 2025-09-01
PublicationDate_xml – month: 09
  year: 2025
  text: 2025-09-01
  day: 01
PublicationDecade 2020
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
– name: Heidelberg
PublicationSubtitle An International Journal
PublicationTitle Operational research
PublicationTitleAbbrev Oper Res Int J
PublicationYear 2025
Publisher Springer Berlin Heidelberg
Springer Nature B.V
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer Nature B.V
References 966_CR20
966_CR42
T Gal (966_CR16) 1975; 26
966_CR40
966_CR23
C Yang (966_CR44) 2022; 165
966_CR28
966_CR27
L Breiman (966_CR3) 2017
HP Benson (966_CR2) 1978; 26
B Brosowski (966_CR7) 1994; 16
966_CR29
Q Yu (966_CR47) 2023; 19
PJ Agrell (966_CR1) 1997; 98
S Lumbreras (966_CR25) 2025; 15
T Gal (966_CR19) 1977; 1
C Yang (966_CR43) 2024; 74
Q Yu (966_CR48) 2024; 88
G Saito (966_CR34) 2015; 251
P Sumathi (966_CR36) 2016; 37
966_CR30
C Yang (966_CR45) 2024; 60
966_CR13
966_CR35
966_CR11
966_CR33
DG Tsarmpopoulos (966_CR41) 2023; 13
966_CR39
966_CR38
966_CR9
966_CR37
M Ehrgott (966_CR15) 2005
S Paulraj (966_CR32) 2010
L Costa (966_CR12) 2003; 11
966_CR5
966_CR6
T Gal (966_CR17) 1992; 60
D Brockhoff (966_CR4) 2009; 17
T Gal (966_CR18) 1999; 119
C Yang (966_CR46) 2024; 222
HW Corley (966_CR10) 2006; 27
S Jibrin (966_CR22) 2007; 10
CD Nikolakakou (966_CR31) 2015; 92
VC Jacob (966_CR21) 2002; 39
K Deb (966_CR14) 2005; 2005011
DT Luc (966_CR24) 2016
RT Marler (966_CR26) 2004; 26
V Charles (966_CR8) 2010; 201
References_xml – volume: 74
  start-page: 3273
  issue: 7
  year: 2024
  ident: 966_CR43
  publication-title: Advances in Space Research
  doi: 10.1016/j.asr.2024.06.002
– volume: 251
  start-page: 586
  year: 2015
  ident: 966_CR34
  publication-title: Applied Mathematics Computations
  doi: 10.1016/j.amc.2014.11.080
– volume: 13
  start-page: 177
  issue: 6
  year: 2023
  ident: 966_CR41
  publication-title: American Journal of Operations Research
  doi: 10.4236/ajor.2023.136010
– volume: 39
  start-page: 202
  issue: 3
  year: 2002
  ident: 966_CR21
  publication-title: Opsearch
  doi: 10.1007/BF03398681
– volume: 26
  start-page: 369
  issue: 6
  year: 2004
  ident: 966_CR26
  publication-title: Structural Multidisciplinary Optimization
  doi: 10.1007/s00158-003-0368-6
– ident: 966_CR29
– ident: 966_CR42
– ident: 966_CR23
– volume: 15
  start-page: 5732
  issue: 10
  year: 2025
  ident: 966_CR25
  publication-title: Applied Sciences
  doi: 10.3390/app15105732
– volume: 27
  start-page: 1047
  issue: 9–10
  year: 2006
  ident: 966_CR10
  publication-title: International Journal of Advanced Manufacturing Technology
  doi: 10.1007/s00170-004-2278-1
– volume: 10
  start-page: 601
  issue: 5
  year: 2007
  ident: 966_CR22
  publication-title: Journal of Interdisciplinary Mathematics
  doi: 10.1080/09720502.2007.10700521
– volume: 16
  start-page: 243
  issue: 4
  year: 1994
  ident: 966_CR7
  publication-title: Operations Research Spektrum
  doi: 10.1007/BF01720315
– volume: 201
  start-page: 390
  issue: 2
  year: 2010
  ident: 966_CR8
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2009.03.020
– ident: 966_CR13
– volume: 26
  start-page: 569
  year: 1978
  ident: 966_CR2
  publication-title: Journal of Optimization Theory and Applications
  doi: 10.1007/BF00933152
– ident: 966_CR30
– volume: 92
  start-page: 722
  issue: 4
  year: 2015
  ident: 966_CR31
  publication-title: Interantional Journal of Computer Mathematics
  doi: 10.1080/00207160.2014.907403
– ident: 966_CR38
  doi: 10.1145/3503823.3503848
– volume: 19
  start-page: 7561
  issue: 6
  year: 2023
  ident: 966_CR47
  publication-title: IEEE Transactions on Industrial Informatics
  doi: 10.1109/TII.2022.3211853
– ident: 966_CR9
  doi: 10.1142/9789811293009_0028
– volume: 98
  start-page: 571
  issue: 3
  year: 1997
  ident: 966_CR1
  publication-title: European Journal Operational Research
  doi: 10.1016/0377-2217(95)00340-1
– ident: 966_CR33
  doi: 10.4018/978-1-4666-5888-2.ch346
– ident: 966_CR20
– volume: 37
  start-page: 495
  issue: 4
  year: 2016
  ident: 966_CR36
  publication-title: Journal of Information and Optimization Sciences
  doi: 10.1080/02522667.2014.996031
– volume: 60
  start-page: 6461
  issue: 5
  year: 2024
  ident: 966_CR45
  publication-title: IEEE Transactions on Aerospace and Electronic Systems
  doi: 10.1109/TAES.2024.3404915
– ident: 966_CR39
  doi: 10.1145/3437120.3437320
– volume: 11
  start-page: 417
  issue: 4
  year: 2003
  ident: 966_CR12
  publication-title: Evolutionary Computation
  doi: 10.1162/106365603322519297
– volume: 119
  start-page: 373
  issue: 2
  year: 1999
  ident: 966_CR18
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(99)00139-3
– volume: 165
  year: 2022
  ident: 966_CR44
  publication-title: Mechanical Systems and Signal Processing
  doi: 10.1016/j.ymssp.2021.108386
– volume-title: Classification and regression trees
  year: 2017
  ident: 966_CR3
  doi: 10.1201/9781315139470
– volume: 88
  year: 2024
  ident: 966_CR48
  publication-title: Swarm and Evolutionary Computation
  doi: 10.1016/j.swevo.2024.101584
– year: 2010
  ident: 966_CR32
  publication-title: Mathematical Problems in Engineering
  doi: 10.1155/2010/723402
– ident: 966_CR27
  doi: 10.1007/978-1-4615-5563-6
– ident: 966_CR28
– volume: 1
  start-page: 176
  issue: 3
  year: 1977
  ident: 966_CR19
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(77)90025-X
– volume: 17
  start-page: 135
  issue: 2
  year: 2009
  ident: 966_CR4
  publication-title: Evolutionary Computation
  doi: 10.1162/evco.2009.17.2.135
– ident: 966_CR6
  doi: 10.1007/978-3-540-69995-8_68
– volume: 26
  start-page: 735
  issue: 4
  year: 1975
  ident: 966_CR16
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.1975.152
– volume: 60
  start-page: 315
  issue: 3
  year: 1992
  ident: 966_CR17
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(92)90083-L
– ident: 966_CR11
  doi: 10.1002/pamm.200700561
– volume-title: Multiobjective linear programming: an introduction
  year: 2016
  ident: 966_CR24
  doi: 10.1007/978-3-319-21091-9
– volume: 2005011
  start-page: 1
  year: 2005
  ident: 966_CR14
  publication-title: Kangal Report
– volume: 222
  start-page: 207
  year: 2024
  ident: 966_CR46
  publication-title: Acta Astronautica
  doi: 10.1016/j.actaastro.2024.06.002
– ident: 966_CR5
  doi: 10.1007/11844297_54
– volume-title: Multicriteria optimization
  year: 2005
  ident: 966_CR15
– ident: 966_CR37
– ident: 966_CR35
– ident: 966_CR40
  doi: 10.1145/3575879.3575990
SSID ssj0000327848
ssib004298988
Score 2.329251
SecondaryResourceType review_article
Snippet The purpose of this paper is to investigate the constraints shaping the Pareto front in multi-objective linear programming, by applying recently proposed...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 87
SubjectTerms Algorithms
Binding
Business and Management
Computational Intelligence
Constraints
Decision making
Intersections
Linear programming
Management Science
Multiple objective analysis
Operations Research
Operations Research/Decision Theory
Optimization techniques
Pareto optimum
Redundancy
Review Article
Subtitle Redundancy and delimitation of the Pareto front
Title Redundancy and delimitation of the Pareto front
URI https://link.springer.com/article/10.1007/s12351-025-00966-6
https://www.proquest.com/docview/3237071609
Volume 25
WOSCitedRecordID wos001545133500001&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: PRVAVX
  databaseName: SpringerLink Contemporary Journals
  customDbUrl:
  eissn: 1866-1505
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000327848
  issn: 1109-2858
  databaseCode: RSV
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BYYCBN6JQkAc2sHBsx7FHhKiYqqo81C2KH5GQUFq1hd-P7SZKQTDAnMiKvrPvkfP3HcClTRzjNiNYSqExd0mCVRZ-wGufHAmqHKXLYRPZYCDHYzWsSWHz5rZ705KMnrolu1GW-tKXpjjk3QKLddjw4U6GgQ2jx5dVDysbEa7oj1lorkVOXBLaCTKVNXvm52W_Rqg27fzWKY0BqL_7v0_fg5064US3yx2yD2uuOoDtFRnCQ7gZucAlC34WFZVF1r0F2lO0GZqUyOeIaBim4U5QGfQOjuC5f_9094DrQQrYsEQssDaZNsKUVFmtjSRWehs4pXnQS9PUEq2kMSUpaVJwSbRIrc0scVx7f5hyw46hU00qdwKI08JKntq08IUbV2VBNC21VFooZVhGunDVgJdPl3oZeauMHGDIPQx5hCEXXeg1-Ob12ZnnjPp1fBlHVBeuGzzbx7-vdvq3189gi0aThAtjPegsZu_uHDbNx-J1PruIe-oTNrHB5A
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD7oFNQH7-J0ah9802CapmnyKOKYOMeYU_YWmktBkE626e836Vo6RR_0uSWU7yTn0pPvOwDnJrQRNQlGnDOFqA1DJBL_A1655IgRYQmZD5tIej0-Gol-SQqbVrfdq5Zk4alrshuJYlf6khj5vJshtgwr1EUsr5g_eHxe9LC8EuEq_HHkm2sFJy707QQe85I98_OyXyNUnXZ-65QWAai99b9P34bNMuEMruc7ZAeWbL4LGwsyhHtwNbCeS-b9bJDmJjD21dOeCpsF4yxwOWLQ99Nwx0Hm9Q724al9O7zpoHKQAtJRyGZI6URppjMijFKaY8OdDaxQ1OulKWKwElzrDGckTCnHisXGJAZbqpw_jKmODqCRj3N7CAElqeE0NnHqCjcqshQrkikuFBNCRwluwkUFnnyb62XIWhnZwyAdDLKAQbImtCp8ZXl2pjIibh1XxmHRhMsKz_rx76sd_e31M1jrDB-6snvXuz-GdVKYx18ea0FjNnm3J7CqP2Yv08lpsb8-AVeBxMg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50FdGDb3F11Ry8adk0TdPkKOqiKMvii72F5lEQpLvsVn-_Sbelq-hBPLcM9JtkMtPJ9w3AqQltRE2CA86ZCqgNw0Ak_ge8cskRI8ISMhs2kfT7fDgUgzkWf3nbvW5JzjgNXqUpL7pjk3Ub4huJYlcGkzjwOTgL2CIsUX-R3tfrjy_z0ZbXglxlbI58o63kx4W-tcBjXjFpfjb79bRqUtBvXdPyMOpt_P8zNmG9SkTRxWzlbMGCzbdhbU6ecAe6D9ZzzHz8RWlukLFvng5V-hKNMuRyRzTwU3JHKPM6CLvw3Lt-urwJqgELgY5CVgRKJ0oznRFhlNIcG-58Y4WiXkdNEYOV4FpnOCNhSjlWLDYmMdhS5eJkTHW0B618lNt9QJSkhtPYxKkr6KjIUqxIprhQTAgdJbgNZzWQcjzT0ZCNYrKHQToYZAmDZG3o1FjLak9NZUScHVfeYdGG8xrb5vHv1g7-9voJrAyuevL-tn93CKuk9I6_U9aBVjF5t0ewrD-K1-nkuFxqnxWUzaw
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=Redundancy+and+delimitation+of+the+Pareto+front&rft.jtitle=Operational+research&rft.au=Nikolakakou%2C+Christina+D.&rft.date=2025-09-01&rft.issn=1109-2858&rft.eissn=1866-1505&rft.volume=25&rft.issue=3&rft_id=info:doi/10.1007%2Fs12351-025-00966-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s12351_025_00966_6
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1109-2858&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1109-2858&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1109-2858&client=summon