Pareto reducible multicriteria optimization problems

A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for a subproblem obtained from it by selecting certain criteria. The aim of this article is to provide sufficient conditions for Pareto red...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 54; no. 3; pp. 253 - 263
Main Author Popovici, Nicolae
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis Group 01.06.2005
Taylor & Francis LLC
Subjects
Online AccessGet full text
ISSN0233-1934
1029-4945
DOI10.1080/02331930500096213

Cover

Abstract A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for a subproblem obtained from it by selecting certain criteria. The aim of this article is to provide sufficient conditions for Pareto reducibility in a general framework, recovering in particular some known results concerning convex or explicitly quasiconvex criteria.
AbstractList A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for a subproblem obtained from it by selecting certain criteria. The aim of this article is to provide sufficient conditions for Pareto reducibility in a general framework, recovering in particular some known results concerning convex or explicitly quasiconvex criteria.
A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself or for a subproblem obtained from it by selecting certain criteria. The aim of this article is to provide sufficient conditions for Pareto reducibility in a general framework, recovering in particular some known results concerning convex or explicitly quasiconvex criteria. [PUBLICATION ABSTRACT]
Author Popovici, Nicolae
Author_xml – sequence: 1
  givenname: Nicolae
  surname: Popovici
  fullname: Popovici, Nicolae
BookMark eNqFkE1LAzEQhoNUsK3-AG-L99XJ12YDXqT4BQU99B6yaRZSdjc1SdH6601tTxb1NId5n3mGd4JGgx8sQpcYrjHUcAOEUiwpcACQFcH0BI0xEFkyyfgIjXf7MgfYGZrEuAIguCJsjNirDjb5Itjlxrims0W_6ZIzwSUbnC78Orneferk_FCsg8-JPp6j01Z30V4c5hQtHu4Xs6dy_vL4PLubl4YKmsqWcdZaLoUUNWZNo1vSUEGobEwrrGC2rjkFIpgGsLDU2nKoDDea2_y5pVN0tT-bvW8bG5Na-U0YslERLBlhFcY5JPYhE3yMwbbKuPT9bgradQqD2hWkjgrKJP5BroPrddj-yRxsbmh96PW7D91SJb3tfGiDHoyLx5RKHymTt_-S9HfxF_OGjcA
CODEN OPTZDQ
CitedBy_id crossref_primary_10_1080_02331934_2024_2384919
crossref_primary_10_1080_02331934_2013_869810
crossref_primary_10_1287_mnsc_1070_0848
crossref_primary_10_1016_j_matcom_2018_08_004
crossref_primary_10_1007_s00186_016_0547_z
crossref_primary_10_1007_s10898_019_00737_6
crossref_primary_10_1016_j_ejor_2009_01_061
crossref_primary_10_1016_j_orl_2005_03_003
crossref_primary_10_1007_s10957_021_01961_5
crossref_primary_10_1080_01630563_2024_2405479
crossref_primary_10_1186_s13660_015_0838_6
crossref_primary_10_1016_j_na_2011_05_070
crossref_primary_10_15407_itm2022_03_063
crossref_primary_10_1080_02331934_2012_672984
crossref_primary_10_1016_j_ejor_2016_10_045
crossref_primary_10_1007_s10479_015_1861_1
crossref_primary_10_1016_j_ejor_2013_02_037
crossref_primary_10_1007_s10898_006_9085_1
crossref_primary_10_1016_j_orl_2007_09_002
crossref_primary_10_1007_s10957_020_01667_0
crossref_primary_10_15407_knit2023_04_003
crossref_primary_10_1109_MAP_2006_1645560
crossref_primary_10_1080_02331934_2019_1711082
crossref_primary_10_1002_mcda_1598
crossref_primary_10_1137_16M1096505
crossref_primary_10_1016_j_orl_2009_11_003
crossref_primary_10_33993_jnaat371_876
crossref_primary_10_1007_s10957_010_9786_y
Cites_doi 10.1006/jmaa.2000.6960
10.1287/mnsc.30.11.1346
10.1080/02331930310001637396
10.1023/A:1017571214523
10.1023/A:1022448811953
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2005
Copyright Taylor & Francis Group Jun 2005
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2005
– notice: Copyright Taylor & Francis Group Jun 2005
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
DOI 10.1080/02331930500096213
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 263
ExternalDocumentID 854064261
10_1080_02331930500096213
10051762
Genre Feature
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
ACAGQ
ACGEJ
ACGFS
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALCKM
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMEWO
AMVHM
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CAG
CCCUG
CE4
COF
CRFIH
CS3
DKSSO
DMQIW
DU5
EBS
EJD
E~A
E~B
GTTXZ
H13
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
NA5
O9-
P2P
PQQKQ
QCRFL
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TOXWX
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
07G
1TA
AAIKQ
AAKBW
AAYXX
ACGEE
ACTCW
AEUMN
AGCQS
AGLEN
AMXXU
BCCOT
BPLKW
C06
CITATION
DWIFK
HF~
IVXBP
LJTGL
NUSFT
TAQ
TFMCV
UB9
UU8
V3K
V4Q
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c373t-f454fe59797814bbaf2b37239bcf7e74e88530274a00e0daae506c5ca5e029e3
ISSN 0233-1934
IngestDate Wed Aug 13 04:27:06 EDT 2025
Thu Apr 24 22:54:49 EDT 2025
Wed Oct 01 04:30:52 EDT 2025
Mon Oct 20 23:36:09 EDT 2025
Mon May 13 12:09:11 EDT 2019
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c373t-f454fe59797814bbaf2b37239bcf7e74e88530274a00e0daae506c5ca5e029e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 219424611
PQPubID 27961
PageCount 11
ParticipantIDs proquest_journals_219424611
informaworld_taylorfrancis_310_1080_02331930500096213
crossref_citationtrail_10_1080_02331930500096213
crossref_primary_10_1080_02331930500096213
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 6/1/2005
2005-06-00
20050601
PublicationDateYYYYMMDD 2005-06-01
PublicationDate_xml – month: 06
  year: 2005
  text: 6/1/2005
  day: 01
PublicationDecade 2000
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2005
Publisher Taylor & Francis Group
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis Group
– name: Taylor & Francis LLC
References Benoist J (bib6) 2002; 7
Malivert C (bib2) 1994; 1
Luc DT (bib7) 1989
bib8
bib5
bib3
bib4
bib1
Debreu G (bib9) 1959
References_xml – ident: bib4
  doi: 10.1006/jmaa.2000.6960
– volume: 7
  start-page: 67
  year: 2002
  ident: bib6
  publication-title: Nonlinear Analysis Forum
– ident: bib1
  doi: 10.1287/mnsc.30.11.1346
– volume: 1
  start-page: 143
  year: 1994
  ident: bib2
  publication-title: Journal of Convex Analysis
– ident: bib8
  doi: 10.1080/02331930310001637396
– volume-title: Theory of Value
  year: 1959
  ident: bib9
– ident: bib5
  doi: 10.1023/A:1017571214523
– ident: bib3
  doi: 10.1023/A:1022448811953
– volume-title: Springer-Verlag
  year: 1989
  ident: bib7
SSID ssj0021624
Score 1.7978451
Snippet A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient solutions actually are efficient solutions for the problem itself...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 253
SubjectTerms Cone-radiant sets
Hierarchies
Mathematics Subject Classifications 2000: 90C29
Multicriteria optimization
Optimization
Pareto optimum
Pareto reducibility
Studies
Title Pareto reducible multicriteria optimization problems
URI https://www.tandfonline.com/doi/abs/10.1080/02331930500096213
https://www.proquest.com/docview/219424611
Volume 54
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1029-4945
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021624
  issn: 0233-1934
  databaseCode: AHDZW
  dateStart: 19970101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1029-4945
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021624
  issn: 0233-1934
  databaseCode: 30N
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.tandfonline.com/page/title-lists
  providerName: Taylor & Francis
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA66veiDeMU5lT745Ki0Sdq0j8MLQ_DyMHH4UposBUHXsVUQf70nTXrZpsP5kpaSJlu_9jsn7TnfQegs9APGwkAFhYWJTSU0YSA9myWuYIRxTHyV73x37_ee6O3AG1TlwfLskoxfiK8f80r-gyocA1xVluwKyJaDwgHYB3yhBYSh_RPGj6pEbdqZKPnVV5UClYcHAg8oAea4kwIdvJs8y46pHDOte6MPtQ4lR6bjFNjjtbxNYjnzZsCrIpgMgWBCbHDQ9IJdaoJT4S401BKOBQNqGWeDNKnTmRbyNZYRaypaIF0TpQizwWROXmHBxy6pLEzxVX3O8JThgG6hUzo_xDpqYmBrp4Ga3d7Vy3O5lHb9vFxx-Q-L79VKNX1-kBmPY0aPdsH-5k5FfxttmdWA1dXQ7qA1OdpFmzWNyD1ENchWCbI1A7JVB9kqQN5H_Zvr_mXPNqUubEEYyeyEejSRsLjLJcg4jxPMCcMk5CJhklEZBKq8E6Ox40hnGMfSc3zhidiTAKgkB6gxSkfyEFkUC1_IkDI8BE-XuoEg3OWxoEDdDDYt5BRXIxJGBl5VI3mLfkWhhc7LU8ZaA2VZZ6d-iaMsf_GU6Coxi92j7DNrIW_JKWTJVO0Cvsg8ldMILDBVGonu0Sq_uo02qifoGDWyyYc8AW8z46fm1vsGc0N0xw
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6hMgADb0QpjwxMSClObMfJiBBVgbZiKFI3K3YdCVFa1KYS4tdjO07VB-rQJVnOTuJc7pXz9wHcJlHMWBKbprAk84nShyRW1GdZIBlmIsSR2e_c7kTNd_LSoz1XcJu4tkqTQ2cFUIS11ebjNsXosiXuXvsZrTlaU20EHhrS2m2qA33DYIBRZ5ZwBZEltTXivpYn5V_N_6ZY8EsLqKUrVtq6nsYB8PKmi46Tz_o0F3X5u4TnuPlTHcK-i0q9h0KNjmBLDY9hbw6r8ATIm-HDHXljg_X6IQbKs72I2ugYtOfUG2nb8-U2dXqOpmZyCt3GU_ex6TvKBV9ihnM_I5RkSicZFgpLiDQLBWYhToTMmGJExbGhGWIkRUihfpoqiiJJZUoVChOFz6AyHA3VOXgklJFUCWFhX0dcJIglFoFIJdEmhOlTFVC53lw6OHLDijHgQYlaurweVbibDfkusDjWCaP5l8hzWwDJCraSVXGe_-RVoGuG4DWXqpUKwp0FmHDtCYjB6gsuNpz1Bnaa3XaLt547rzXYtZCxtvpzCZV8PFVXOhjKxbXV-D82Mvpv
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZQkRAMvBGlPDIwIaU4sRMnIwKq8qo6FKlbFLu2hFraqkklxK_H5zhVH6hDl2Q5O4p9vjvbd9-H0G0cRozFESSFxcqlUj_iSAYuU55ghHGfhFDv_NEKm5_0tRt0bW5OZtMqYQ-tCqAIY6thcY97qsyIu9duRiuOVlQTgPvAWbsdwo0YVHDg1my_5YWG0xbEXS1Py0vN_7pYcEsLoKUrRtp4nsZBQa-aGcBCSDjp16c5r4vfJTjHjX_qEO3bmNR5KJToCG3J4THam0MqPEG0DWy4I2cCSK9ffCAdk4moTQ5gPafOSFueb1vS6ViSmuwUdRrPncemawkXXEEYyV1FA6qk3mIYICzOU-VzwnwSc6GYZFRGEZAMMZpiLHEvTWWAQxGINJDYjyU5Q5XhaCjPkUN9EQoZU-b3dLxFvUgQ7vFUUG1AmH5VES6HOxEWjBw4MQaJV2KWLo9HFd3NmowLJI51wnh-DpPcHH-ogqtkVTzJf_IqCtY0IWs-VSv1I7HrP0u0H6CA1OddbNjrDdppPzWS95fWWw3tGrxYc_RziSr5ZCqvdCSU82uj738Y0vkT
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=Pareto+reducible+multicriteria+optimization+problems&rft.jtitle=Optimization&rft.au=Popovici%2C+Nicolae&rft.date=2005-06-01&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=54&rft.issue=3&rft.spage=253&rft.epage=263&rft_id=info:doi/10.1080%2F02331930500096213&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_02331930500096213
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