Discrete representation of non-dominated sets in multi-objective linear programming

•Discrete representation of non-dominated sets relates to NP-hard location problems.•Known methods do not have the coverage property or bound the uniformity level.•Under some assumptions the RNBI method has bounded uniformity level and coverage error.•Empirical tests on applied problems and random e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 255; číslo 3; s. 687 - 698
Hlavní autoři: Shao, Lizhen, Ehrgott, Matthias
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.12.2016
Elsevier Sequoia S.A
Témata:
ISSN:0377-2217, 1872-6860
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 •Discrete representation of non-dominated sets relates to NP-hard location problems.•Known methods do not have the coverage property or bound the uniformity level.•Under some assumptions the RNBI method has bounded uniformity level and coverage error.•Empirical tests on applied problems and random examples validate the RNBI method. In this paper we address the problem of representing the continuous but non-convex set of non-dominated points of a multi-objective linear programme by a finite subset of such points. We prove that a related decision problem is NP-complete. Moreover, we illustrate the drawbacks of the known global shooting, normal boundary intersection and normal constraint methods concerning the coverage error and uniformity level of the representation by examples. We propose a method which combines the global shooting and normal boundary intersection methods. By doing so, we overcome their limitations, but preserve their advantages. We prove that our method computes a set of evenly distributed non-dominated points for which the coverage error and the uniformity level can be guaranteed. We apply this method to an optimisation problem in radiation therapy and present illustrative results for some clinical cases. Finally, we present numerical results on randomly generated examples.
AbstractList •Discrete representation of non-dominated sets relates to NP-hard location problems.•Known methods do not have the coverage property or bound the uniformity level.•Under some assumptions the RNBI method has bounded uniformity level and coverage error.•Empirical tests on applied problems and random examples validate the RNBI method. In this paper we address the problem of representing the continuous but non-convex set of non-dominated points of a multi-objective linear programme by a finite subset of such points. We prove that a related decision problem is NP-complete. Moreover, we illustrate the drawbacks of the known global shooting, normal boundary intersection and normal constraint methods concerning the coverage error and uniformity level of the representation by examples. We propose a method which combines the global shooting and normal boundary intersection methods. By doing so, we overcome their limitations, but preserve their advantages. We prove that our method computes a set of evenly distributed non-dominated points for which the coverage error and the uniformity level can be guaranteed. We apply this method to an optimisation problem in radiation therapy and present illustrative results for some clinical cases. Finally, we present numerical results on randomly generated examples.
In this paper we address the problem of representing the continuous but non-convex set of non-dominated points of a multi-objective linear programme by a finite subset of such points. We prove that a related decision problem is NP-complete. Moreover, we illustrate the drawbacks of the known global shooting, normal boundary intersection and normal constraint methods concerning the coverage error and uniformity level of the representation by examples. We propose a method which combines the global shooting and normal boundary intersection methods. By doing so, we overcome their limitations, but preserve their advantages. We prove that our method computes a set of evenly distributed non-dominated points for which the coverage error and the uniformity level can be guaranteed. We apply this method to an optimisation problem in radiation therapy and present illustrative results for some clinical cases. Finally, we present numerical results on randomly generated examples.
Author Ehrgott, Matthias
Shao, Lizhen
Author_xml – sequence: 1
  givenname: Lizhen
  surname: Shao
  fullname: Shao, Lizhen
  email: lshao@ustb.edu.cn
  organization: Key Laboratory of Advanced Control of Iron and Steel Process (Ministry of Education), School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China
– sequence: 2
  givenname: Matthias
  surname: Ehrgott
  fullname: Ehrgott, Matthias
  email: m.ehrgott@lancaster.ac.uk
  organization: Department of Management Science, Lancaster University Management School, Bailrigg, Lancaster LA1 4YX, United Kingdom
BookMark eNp9kE1LAzEURYNUsK3-AVcDrmdMJvMVcCP1Ewou1HXIJC8lw0xSk7TgvzdlXLlwlQe5513eWaGFdRYQuia4IJg0t0MBg_NFmeYC1wXG5AwtSdeWedM1eIGWmLZtXpakvUCrEAacEjWpl-j9wQTpIULmYe8hgI0iGmczp7PUkSs3GSsiqCxADJmx2XQYo8ldP4CM5gjZaCwIn-2923kxpfTuEp1rMQa4-n3X6PPp8WPzkm_fnl8399tcVpjFnFDote5AMVqqVvZMa8xqQZmotGoYwaxSWleS0fRTMVUJ2reCUsU6Vlatomt0M-9N3V8HCJEP7uBtquSkI7RjmJI6pbo5Jb0LwYPm0sw3Ri_MyAnmJ4V84CeF_KSQ45onQQkt_6B7bybhv_-H7mYI0ulHA54HacBKUMYnZVw58x_-A6uVjnU
CODEN EJORDT
CitedBy_id crossref_primary_10_1016_j_cmpb_2020_105676
crossref_primary_10_1007_s10107_017_1149_0
crossref_primary_10_1080_00207543_2023_2262065
crossref_primary_10_1016_j_cor_2024_106928
crossref_primary_10_1016_j_ejor_2021_04_005
crossref_primary_10_1016_j_ejor_2023_02_032
crossref_primary_10_1016_j_jclepro_2018_05_262
crossref_primary_10_1371_journal_pone_0206282
crossref_primary_10_1007_s10479_019_03317_9
crossref_primary_10_1007_s11750_019_00535_z
crossref_primary_10_1002_mcda_1628
crossref_primary_10_1016_j_cie_2019_06_036
crossref_primary_10_1016_j_ejor_2016_11_020
crossref_primary_10_1016_j_ejor_2018_08_019
crossref_primary_10_1287_ijoc_2022_1252
crossref_primary_10_1038_s41598_023_33414_6
crossref_primary_10_1016_j_asoc_2023_110027
crossref_primary_10_1016_j_softx_2024_101801
crossref_primary_10_1007_s10726_025_09927_y
crossref_primary_10_1007_s10288_016_0336_9
crossref_primary_10_1016_j_cie_2020_106400
crossref_primary_10_1016_j_ejor_2022_07_044
crossref_primary_10_1016_j_cor_2019_104872
crossref_primary_10_1007_s10589_024_00627_y
Cites_doi 10.1016/j.cor.2014.02.009
10.1007/s00453-001-0022-x
10.1007/s10957-005-5494-4
10.1007/s10479-009-0659-4
10.1137/S1052623496307510
10.1023/A:1008215702611
10.1016/j.cor.2015.05.003
10.2514/1.8977
10.1007/s00158-007-0185-4
10.1016/0305-0548(91)90040-X
10.1007/s00158-013-0925-6
10.1007/s00158-006-0071-5
10.1002/(SICI)1520-6750(199702)44:1<47::AID-NAV3>3.0.CO;2-M
10.1007/s00158-011-0729-5
10.1016/0022-247X(75)90189-4
10.1007/BF00932907
10.1007/s101070050128
10.1287/opre.51.3.427.14951
10.1007/s11081-009-9099-x
10.1007/s00158-011-0698-8
10.1007/s00158-002-0276-1
10.1007/s00186-008-0220-2
10.1007/s10589-011-9403-5
10.1287/opre.22.1.189
10.1137/080729013
ContentType Journal Article
Copyright 2016 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Dec 16, 2016
Copyright_xml – notice: 2016 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Dec 16, 2016
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ejor.2016.05.001
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
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
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1872-6860
EndPage 698
ExternalDocumentID 4158156921
10_1016_j_ejor_2016_05_001
S0377221716303010
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
4.4
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AARIN
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACIWK
ACNCT
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
AEBSH
AEFWE
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
AXJTR
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
RIG
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
XPP
ZMT
~02
~G-
1OL
29G
41~
9DU
AAAKG
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADIYS
ADJOM
ADMUD
ADNMO
ADXHL
AEIPS
AEUPX
AFFNX
AFJKZ
AFPUW
AGQPQ
AI.
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
FEDTE
FGOYB
HVGLF
HZ~
R2-
SEW
VH1
WUQ
~HD
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c409t-13ebff8ed932d7cb9ff095a39a4fd691094dff4c939ff49d4a3b7a33d989247d3
ISICitedReferencesCount 27
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000381530000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0377-2217
IngestDate Sun Nov 09 08:28:34 EST 2025
Sat Nov 29 07:22:59 EST 2025
Tue Nov 18 21:51:08 EST 2025
Fri Feb 23 02:27:39 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Linear programming
Non-dominated set
Discrete representation
Multi-objective optimisation
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c409t-13ebff8ed932d7cb9ff095a39a4fd691094dff4c939ff49d4a3b7a33d989247d3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 1813890315
PQPubID 45678
PageCount 12
ParticipantIDs proquest_journals_1813890315
crossref_citationtrail_10_1016_j_ejor_2016_05_001
crossref_primary_10_1016_j_ejor_2016_05_001
elsevier_sciencedirect_doi_10_1016_j_ejor_2016_05_001
PublicationCentury 2000
PublicationDate 2016-12-16
PublicationDateYYYYMMDD 2016-12-16
PublicationDate_xml – month: 12
  year: 2016
  text: 2016-12-16
  day: 16
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle European journal of operational research
PublicationYear 2016
Publisher Elsevier B.V
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Sequoia S.A
References Logist, Van Impe (bib0014) 2012; 45
Ismail-Yahaya, Messac (bib0013) 2002
Vaz, Paquete, Fonseca, Klamroth, Stiglmayr (bib0028) 2015; 63
Isermann (bib0012) 1974; 22
Yu, Zeleny (bib0030) 1975; 49
Martinez, Sanchis, Blasco (bib0015) 2007; 34
Mueller-Gritschneder, Graeb, Schlichtmann (bib0019) 2009; 20
Shao, Ehrgott (bib0027) 2008; 68
Benson (bib0002) 1998; 13
(bib0010) 2016; vol. 78
Ruzika, Wiecek (bib0022) 2005; 126
Hancock, Mattson (bib0011) 2013; 48
Motta, Afonso, Lyra (bib0018) 2012; 46
Messac, Ismail-Yahaya, Mattson (bib0016) 2003; 25
Sanchis, Martínez, Blasco, Salcedo (bib0023) 2008; 36
Shao, Ehrgott (bib0026) 2007
Eusébio, Figueira, Ehrgott (bib0007) 2014; 48
Messac, Mattson (bib0017) 2004; 42
Baur, Fekete (bib0001) 2001; 30
Benson, Sayin (bib0003) 1997; 44
Rockafellar (bib0021) 1970
Faulkenberg, Wiecek (bib0008) 2010; 11
Ehrgott (bib0005) 2005
Faulkenberg, Wiecek (bib0009) 2012; 51
Sayın (bib0025) 2003; 51
White (bib0029) 1991; 18
Sayin (bib0024) 2000; 87
Das, Dennis (bib0004) 1998; 8
Ehrgott, Güler, Hamacher, Shao (bib0006) 2009; 175
Naccache (bib0020) 1978; 25
White (10.1016/j.ejor.2016.05.001_bib0029) 1991; 18
Baur (10.1016/j.ejor.2016.05.001_bib0001) 2001; 30
Ehrgott (10.1016/j.ejor.2016.05.001_bib0005) 2005
Isermann (10.1016/j.ejor.2016.05.001_bib0012) 1974; 22
Rockafellar (10.1016/j.ejor.2016.05.001_bib0021) 1970
Hancock (10.1016/j.ejor.2016.05.001_bib0011) 2013; 48
Ruzika (10.1016/j.ejor.2016.05.001_bib0022) 2005; 126
Vaz (10.1016/j.ejor.2016.05.001_bib0028) 2015; 63
Das (10.1016/j.ejor.2016.05.001_bib0004) 1998; 8
(10.1016/j.ejor.2016.05.001_bib0010) 2016; vol. 78
Naccache (10.1016/j.ejor.2016.05.001_bib0020) 1978; 25
Ismail-Yahaya (10.1016/j.ejor.2016.05.001_sbref0013) 2002
Benson (10.1016/j.ejor.2016.05.001_bib0002) 1998; 13
Martinez (10.1016/j.ejor.2016.05.001_bib0015) 2007; 34
Benson (10.1016/j.ejor.2016.05.001_bib0003) 1997; 44
Mueller-Gritschneder (10.1016/j.ejor.2016.05.001_bib0019) 2009; 20
Messac (10.1016/j.ejor.2016.05.001_bib0017) 2004; 42
Motta (10.1016/j.ejor.2016.05.001_bib0018) 2012; 46
Ehrgott (10.1016/j.ejor.2016.05.001_bib0006) 2009; 175
Faulkenberg (10.1016/j.ejor.2016.05.001_bib0009) 2012; 51
Yu (10.1016/j.ejor.2016.05.001_bib0030) 1975; 49
Faulkenberg (10.1016/j.ejor.2016.05.001_bib0008) 2010; 11
Messac (10.1016/j.ejor.2016.05.001_bib0016) 2003; 25
Eusébio (10.1016/j.ejor.2016.05.001_bib0007) 2014; 48
Logist (10.1016/j.ejor.2016.05.001_bib0014) 2012; 45
Sayin (10.1016/j.ejor.2016.05.001_bib0024) 2000; 87
Shao (10.1016/j.ejor.2016.05.001_bib0027) 2008; 68
Sanchis (10.1016/j.ejor.2016.05.001_bib0023) 2008; 36
Shao (10.1016/j.ejor.2016.05.001_bib0026) 2007
Sayın (10.1016/j.ejor.2016.05.001_bib0025) 2003; 51
References_xml – volume: 8
  start-page: 631
  year: 1998
  end-page: 657
  ident: bib0004
  article-title: Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems
  publication-title: SIAM Journal on Optimization
– volume: 25
  start-page: 86
  year: 2003
  end-page: 98
  ident: bib0016
  article-title: The normalized constraint method for generating the Pareto frontier
  publication-title: Structural and Multidisciplinary Optimization
– volume: 51
  start-page: 427
  year: 2003
  end-page: 436
  ident: bib0025
  article-title: A procedure to find discrete representations of the efficient set with specified coverage errors
  publication-title: Operations Research
– volume: 126
  start-page: 473
  year: 2005
  end-page: 501
  ident: bib0022
  article-title: Survey paper approximation methods in multiobjective programming
  publication-title: Journal of optimization theory and applications
– volume: 63
  start-page: 172
  year: 2015
  end-page: 186
  ident: bib0028
  article-title: Representation of the non-dominated set in biobjective discrete optimization.
  publication-title: Computers & Operations Research
– start-page: 245
  year: 2007
  end-page: 252
  ident: bib0026
  article-title: Finding representative nondominated points in multiobjective linear programming
  publication-title: Proceedings of the 1st IEEE symposium on computational intelligence in multicriteria decision making, MCDM 2007
– volume: 44
  start-page: 47
  year: 1997
  end-page: 67
  ident: bib0003
  article-title: Towards finding global representations of the efficient set in multiple objective mathematical programming
  publication-title: Naval Research Logistics
– volume: 45
  start-page: 417
  year: 2012
  end-page: 431
  ident: bib0014
  article-title: Novel insights for multi-objective optimisation in engineering using normal boundary instersection and (enhanced) normalised normal constraint
  publication-title: Structural and Multidisciplinary Optimization
– volume: 68
  start-page: 257
  year: 2008
  end-page: 276
  ident: bib0027
  article-title: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
  publication-title: Mathematical Methods of Operations Research
– volume: 25
  start-page: 459
  year: 1978
  end-page: 467
  ident: bib0020
  article-title: Connectedness of the set of nondominated outcomes in multicriteria optimization
  publication-title: Journal of Optimization Theory and Applications
– volume: 48
  start-page: 1
  year: 2014
  end-page: 10
  ident: bib0007
  article-title: On finding representative non-dominated points for bi-objective integer network flow problems
  publication-title: Computers & Operations Research
– volume: 42
  start-page: 2101
  year: 2004
  end-page: 2111
  ident: bib0017
  article-title: Normal constraint method with guarantee of even representation of complete Pareto frontier
  publication-title: AIAA Journal
– volume: 20
  start-page: 915
  year: 2009
  end-page: 934
  ident: bib0019
  article-title: A successive approach to compute the bounded Pareto front of practical multiobjective optimization problems
  publication-title: SIAM Journal on Optimization
– volume: 49
  start-page: 430
  year: 1975
  end-page: 468
  ident: bib0030
  article-title: The set of all nondominated solutions in linear cases and a multicriteria simplex method
  publication-title: Journal of Mathematical Analysis and Applications
– year: 1970
  ident: bib0021
  publication-title: Convex analysis
– volume: 34
  start-page: 197
  year: 2007
  end-page: 209
  ident: bib0015
  article-title: Global and well-distributed Pareto frontier by modified normalized normal constraint methods for bicriterion problems
  publication-title: Structural and Multidisciplinary Optimization
– volume: 87
  start-page: 543
  year: 2000
  end-page: 560
  ident: bib0024
  article-title: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
  publication-title: Mathematical Programming
– volume: 18
  start-page: 43
  year: 1991
  end-page: 50
  ident: bib0029
  article-title: The maximal dispersion problem and the “first point outside the neighbourhood heuristic”
  publication-title: Computers & Operations Research
– volume: 30
  start-page: 451
  year: 2001
  end-page: 470
  ident: bib0001
  article-title: Approximation of geometric dispersion problems
  publication-title: Algorithmica
– year: 2005
  ident: bib0005
  publication-title: Multicriteria optimization
– volume: 22
  start-page: 189
  year: 1974
  end-page: 191
  ident: bib0012
  article-title: Proper efficiency and the linear vector maximum problem
  publication-title: Operations Research
– year: 2002
  ident: bib0013
  article-title: Effective generation of the Pareto frontier using the normal constraint method
  publication-title: Proceedings of the 40th aerospace sciences meeting and exhibit
– volume: 46
  start-page: 239
  year: 2012
  end-page: 259
  ident: bib0018
  article-title: A modified NBI and NC method for the solution of
  publication-title: Structural and Multidisciplinary Optimization
– volume: 36
  start-page: 537
  year: 2008
  end-page: 546
  ident: bib0023
  article-title: A new perspective on multiobjective optimization by enhanced normalized normal constraint method
  publication-title: Structural and Multidisciplinary Optimization
– volume: 51
  start-page: 1173
  year: 2012
  end-page: 1210
  ident: bib0009
  article-title: Generating equidistant representations in biobjective programming
  publication-title: Computational Optimization and Applications
– volume: vol. 78
  year: 2016
  ident: bib0010
  publication-title: Multiple criteria decision analysis: State of the art surveys
– volume: 175
  start-page: 309
  year: 2009
  end-page: 365
  ident: bib0006
  article-title: Mathematical optimization in intensity modulated radiation therapy
  publication-title: Annals of Operations Research
– volume: 48
  start-page: 763
  year: 2013
  end-page: 775
  ident: bib0011
  article-title: The smart normal constraint method for directly generating a smart Pareto set
  publication-title: Structural and Multidisciplinary Optimization
– volume: 13
  start-page: 1
  year: 1998
  end-page: 24
  ident: bib0002
  article-title: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
  publication-title: Journal of Global Optimization
– volume: 11
  start-page: 423
  year: 2010
  end-page: 440
  ident: bib0008
  article-title: On the quality of discrete representations in multiple objective programming
  publication-title: Optimization and Engineering
– volume: 48
  start-page: 1
  year: 2014
  ident: 10.1016/j.ejor.2016.05.001_bib0007
  article-title: On finding representative non-dominated points for bi-objective integer network flow problems
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2014.02.009
– volume: 30
  start-page: 451
  issue: 3
  year: 2001
  ident: 10.1016/j.ejor.2016.05.001_bib0001
  article-title: Approximation of geometric dispersion problems
  publication-title: Algorithmica
  doi: 10.1007/s00453-001-0022-x
– volume: 126
  start-page: 473
  issue: 3
  year: 2005
  ident: 10.1016/j.ejor.2016.05.001_bib0022
  article-title: Survey paper approximation methods in multiobjective programming
  publication-title: Journal of optimization theory and applications
  doi: 10.1007/s10957-005-5494-4
– volume: 175
  start-page: 309
  issue: 1
  year: 2009
  ident: 10.1016/j.ejor.2016.05.001_bib0006
  article-title: Mathematical optimization in intensity modulated radiation therapy
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-009-0659-4
– start-page: 245
  year: 2007
  ident: 10.1016/j.ejor.2016.05.001_bib0026
  article-title: Finding representative nondominated points in multiobjective linear programming
– volume: 8
  start-page: 631
  issue: 3
  year: 1998
  ident: 10.1016/j.ejor.2016.05.001_bib0004
  article-title: Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems
  publication-title: SIAM Journal on Optimization
  doi: 10.1137/S1052623496307510
– volume: 13
  start-page: 1
  issue: 1
  year: 1998
  ident: 10.1016/j.ejor.2016.05.001_bib0002
  article-title: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
  publication-title: Journal of Global Optimization
  doi: 10.1023/A:1008215702611
– year: 1970
  ident: 10.1016/j.ejor.2016.05.001_bib0021
– volume: 63
  start-page: 172
  issue: 1
  year: 2015
  ident: 10.1016/j.ejor.2016.05.001_bib0028
  article-title: Representation of the non-dominated set in biobjective discrete optimization.
  publication-title: Computers & Operations Research
  doi: 10.1016/j.cor.2015.05.003
– volume: 42
  start-page: 2101
  issue: 10
  year: 2004
  ident: 10.1016/j.ejor.2016.05.001_bib0017
  article-title: Normal constraint method with guarantee of even representation of complete Pareto frontier
  publication-title: AIAA Journal
  doi: 10.2514/1.8977
– volume: 36
  start-page: 537
  issue: 5
  year: 2008
  ident: 10.1016/j.ejor.2016.05.001_bib0023
  article-title: A new perspective on multiobjective optimization by enhanced normalized normal constraint method
  publication-title: Structural and Multidisciplinary Optimization
  doi: 10.1007/s00158-007-0185-4
– volume: 18
  start-page: 43
  year: 1991
  ident: 10.1016/j.ejor.2016.05.001_bib0029
  article-title: The maximal dispersion problem and the “first point outside the neighbourhood heuristic”
  publication-title: Computers & Operations Research
  doi: 10.1016/0305-0548(91)90040-X
– volume: 48
  start-page: 763
  issue: 4
  year: 2013
  ident: 10.1016/j.ejor.2016.05.001_bib0011
  article-title: The smart normal constraint method for directly generating a smart Pareto set
  publication-title: Structural and Multidisciplinary Optimization
  doi: 10.1007/s00158-013-0925-6
– volume: 34
  start-page: 197
  issue: 3
  year: 2007
  ident: 10.1016/j.ejor.2016.05.001_bib0015
  article-title: Global and well-distributed Pareto frontier by modified normalized normal constraint methods for bicriterion problems
  publication-title: Structural and Multidisciplinary Optimization
  doi: 10.1007/s00158-006-0071-5
– volume: 44
  start-page: 47
  issue: 1
  year: 1997
  ident: 10.1016/j.ejor.2016.05.001_bib0003
  article-title: Towards finding global representations of the efficient set in multiple objective mathematical programming
  publication-title: Naval Research Logistics
  doi: 10.1002/(SICI)1520-6750(199702)44:1<47::AID-NAV3>3.0.CO;2-M
– year: 2005
  ident: 10.1016/j.ejor.2016.05.001_bib0005
– year: 2002
  ident: 10.1016/j.ejor.2016.05.001_sbref0013
  article-title: Effective generation of the Pareto frontier using the normal constraint method
– volume: 46
  start-page: 239
  issue: 2
  year: 2012
  ident: 10.1016/j.ejor.2016.05.001_bib0018
  article-title: A modified NBI and NC method for the solution of N-multiobjective optimization problems
  publication-title: Structural and Multidisciplinary Optimization
  doi: 10.1007/s00158-011-0729-5
– volume: 49
  start-page: 430
  year: 1975
  ident: 10.1016/j.ejor.2016.05.001_bib0030
  article-title: The set of all nondominated solutions in linear cases and a multicriteria simplex method
  publication-title: Journal of Mathematical Analysis and Applications
  doi: 10.1016/0022-247X(75)90189-4
– volume: 25
  start-page: 459
  issue: 3
  year: 1978
  ident: 10.1016/j.ejor.2016.05.001_bib0020
  article-title: Connectedness of the set of nondominated outcomes in multicriteria optimization
  publication-title: Journal of Optimization Theory and Applications
  doi: 10.1007/BF00932907
– volume: 87
  start-page: 543
  issue: 3
  year: 2000
  ident: 10.1016/j.ejor.2016.05.001_bib0024
  article-title: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
  publication-title: Mathematical Programming
  doi: 10.1007/s101070050128
– volume: 51
  start-page: 427
  issue: 3
  year: 2003
  ident: 10.1016/j.ejor.2016.05.001_bib0025
  article-title: A procedure to find discrete representations of the efficient set with specified coverage errors
  publication-title: Operations Research
  doi: 10.1287/opre.51.3.427.14951
– volume: 11
  start-page: 423
  issue: 3
  year: 2010
  ident: 10.1016/j.ejor.2016.05.001_bib0008
  article-title: On the quality of discrete representations in multiple objective programming
  publication-title: Optimization and Engineering
  doi: 10.1007/s11081-009-9099-x
– volume: 45
  start-page: 417
  issue: 3
  year: 2012
  ident: 10.1016/j.ejor.2016.05.001_bib0014
  article-title: Novel insights for multi-objective optimisation in engineering using normal boundary instersection and (enhanced) normalised normal constraint
  publication-title: Structural and Multidisciplinary Optimization
  doi: 10.1007/s00158-011-0698-8
– volume: 25
  start-page: 86
  issue: 2
  year: 2003
  ident: 10.1016/j.ejor.2016.05.001_bib0016
  article-title: The normalized constraint method for generating the Pareto frontier
  publication-title: Structural and Multidisciplinary Optimization
  doi: 10.1007/s00158-002-0276-1
– volume: vol. 78
  year: 2016
  ident: 10.1016/j.ejor.2016.05.001_bib0010
– volume: 68
  start-page: 257
  issue: 2
  year: 2008
  ident: 10.1016/j.ejor.2016.05.001_bib0027
  article-title: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
  publication-title: Mathematical Methods of Operations Research
  doi: 10.1007/s00186-008-0220-2
– volume: 51
  start-page: 1173
  issue: 3
  year: 2012
  ident: 10.1016/j.ejor.2016.05.001_bib0009
  article-title: Generating equidistant representations in biobjective programming
  publication-title: Computational Optimization and Applications
  doi: 10.1007/s10589-011-9403-5
– volume: 22
  start-page: 189
  year: 1974
  ident: 10.1016/j.ejor.2016.05.001_bib0012
  article-title: Proper efficiency and the linear vector maximum problem
  publication-title: Operations Research
  doi: 10.1287/opre.22.1.189
– volume: 20
  start-page: 915
  issue: 2
  year: 2009
  ident: 10.1016/j.ejor.2016.05.001_bib0019
  article-title: A successive approach to compute the bounded Pareto front of practical multiobjective optimization problems
  publication-title: SIAM Journal on Optimization
  doi: 10.1137/080729013
SSID ssj0001515
Score 2.3699772
Snippet •Discrete representation of non-dominated sets relates to NP-hard location problems.•Known methods do not have the coverage property or bound the uniformity...
In this paper we address the problem of representing the continuous but non-convex set of non-dominated points of a multi-objective linear programme by a...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 687
SubjectTerms Decision making
Discrete representation
Linear programming
Multi-objective optimisation
Non-dominated set
Optimization techniques
Problem solving
Radiation therapy
Studies
Title Discrete representation of non-dominated sets in multi-objective linear programming
URI https://dx.doi.org/10.1016/j.ejor.2016.05.001
https://www.proquest.com/docview/1813890315
Volume 255
WOSCitedRecordID wos000381530000002&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-6860
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001515
  issn: 0377-2217
  databaseCode: AIEXJ
  dateStart: 19950105
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9tAEB61oargQNu0iFerPfQWbYWzfu0xgiDaA6oElXJb2d7dJhGNURIQ4tcz-3IeBVQOvTiRE682mfHMN-OZbwC-IkY1rOEJLUuV0Dg_UjRH4IGhiqpSnuSRiqQdNpGdn-eDAf_pn-DP7DiBbDLJ7-749X8VNZ5DYZvW2ReIu1kUT-B7FDoeUex4_CfBn4zQEiAU7li-ytBbZFEhhvpU1qb4xeDMmZrbYlhbU0jrcuxsX8cAT0OA7Sq3_gTf9lj63kNZPDENSUXPHtRkmS-GRe2C__vhou2sP5z-DqUiZuL4qFjJP0R2ao9rjwx9V1lGu13XgRlsatdx73rlYUsWMvX-1Tnb1I2g_suOu5TC-Jsa14a0NUotvapPe6yQZq85s6bEMFSvjYVZQ5g1xFFiSvhewwaqJ89bsNH73h_8aBy3wXb2oZP_Qb7HypUDru_kKRyz5tEtTLl8D9s-viA9pxcf4JWatOFtaG9ow7swxoN4q96GrSVOyo9wEfSHrOoPqTVZ0R9i9IeMJmRNf4jTH7KkP5_g12n_8viM-skbtMJ4f04jpkqtcyUR3cusKrnWCMULxotYyxQRJo-l1nHFGX4ScxkXrMwKxiTPMZ7PJNuBFm5J7QKRjMu0qwxDvYol-odYJzLhTLEKXzK2B1H4H0XlaenNdJQr8bQE96DTXHPtSFme_XYSxCM8rHRwUaC2PXvdYZCl8LfUTCAgRohvRqPsv2gTB7C5uHkOoTWf3qjP8Ka6nY9m0y9eEx8AXY6mhA
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=Discrete+representation+of+non-dominated+sets+in+multi-objective+linear+programming&rft.jtitle=European+journal+of+operational+research&rft.au=Shao%2C+Lizhen&rft.au=Ehrgott%2C+Matthias&rft.date=2016-12-16&rft.issn=0377-2217&rft.volume=255&rft.issue=3&rft.spage=687&rft.epage=698&rft_id=info:doi/10.1016%2Fj.ejor.2016.05.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2016_05_001
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon