On some Fermat rules for set-valued optimization problems

The aim of this article is to obtain necessary optimality conditions for Pareto minima in set-valued optimization problems. We employ a new method to derive generalized Fermat rules for set-valued optimization. This method is based on openness results for multifunctions and allows recovery of a larg...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization Jg. 60; H. 5; S. 575 - 591
Hauptverfasser: Durea, M., Strugariu, R.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Taylor & Francis Group 01.05.2011
Taylor & Francis LLC
Schlagworte:
Fréchet coderivative
generalized Fermat rules
Mathematical functions
Minima
Mordukhovich coderivative
openness
Optimization
Optimization techniques
Pareto optimality
Pareto optimum
Recovery
set-valued mappings
Studies
ISSN:0233-1934, 1029-4945
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The aim of this article is to obtain necessary optimality conditions for Pareto minima in set-valued optimization problems. We employ a new method to derive generalized Fermat rules for set-valued optimization. This method is based on openness results for multifunctions and allows recovery of a large number of results and, at the same time, getting several new ones.
AbstractList The aim of this article is to obtain necessary optimality conditions for Pareto minima in set-valued optimization problems. We employ a new method to derive generalized Fermat rules for set-valued optimization. This method is based on openness results for multifunctions and allows recovery of a large number of results and, at the same time, getting several new ones. [PUBLICATION ABSTRACT]
The aim of this article is to obtain necessary optimality conditions for Pareto minima in set-valued optimization problems. We employ a new method to derive generalized Fermat rules for set-valued optimization. This method is based on openness results for multifunctions and allows recovery of a large number of results and, at the same time, getting several new ones.
Author Durea, M.
Strugariu, R.
Author_xml – sequence: 1
  givenname: M.
  surname: Durea
  fullname: Durea, M.
  email: durea@uaic.ro
  organization: Faculty of Mathematics , Al. I. Cuza University
– sequence: 2
  givenname: R.
  surname: Strugariu
  fullname: Strugariu, R.
  organization: Department of Mathematics , Gh. Asachi Technical University
BookMark eNqFkMtOAyEUhonRxLb6AO4mrtyMHm4zQ-LGNN4Sk250TSiFBMMMFRi1Pr14WdmoG1jwffzn_FO0O4TBIHSE4RRDB2dAKMWCggDKKeak3UETDETUTDC-iyYf73UB2D6apvQIQHBD2ASJxVCl0JvqysRe5SqO3qTKhlglk-tn5UezqsI6u969qezCUK1jWHrTpwO0Z5VP5vD7nqGHq8v7-U19t7i-nV_c1ZpBk2tlBLEr2nHGDLdCdHQFGghRjcENFw3QMprSDbW2U61eYi6IwmA5w5QwDHSGTr7-LcFPo0lZ9i5p470aTBiTxIyITpSjLejxD_QxjHEo08muA2C8pU2B2i9Ix5BSNFZqlz9Xy1E5LzHIj0blVqPFxD_MdXS9ips_ne80N5RSe_USol_JrDY-RBvVoF3atmR-zcU8_9ekvwe_A3zam_g
CODEN OPTZDQ
CitedBy_id crossref_primary_10_1007_s11117_012_0194_4
crossref_primary_10_1007_s11590_010_0197_7
crossref_primary_10_1007_s10107_013_0665_9
crossref_primary_10_1007_s00186_011_0370_5
crossref_primary_10_1007_s10957_021_01848_5
crossref_primary_10_1007_s10898_021_01067_2
crossref_primary_10_1007_s10107_012_0598_8
crossref_primary_10_1007_s11590_013_0690_x
crossref_primary_10_1007_s10898_020_00925_9
crossref_primary_10_1007_s10957_019_01503_0
crossref_primary_10_1007_s10957_016_1059_y
crossref_primary_10_1007_s10957_013_0360_2
crossref_primary_10_1007_s10898_014_0207_x
crossref_primary_10_1016_j_jmaa_2013_10_036
crossref_primary_10_1080_01630563_2019_1708391
crossref_primary_10_1007_s10957_018_1269_6
crossref_primary_10_1080_02331934_2013_811665
crossref_primary_10_1137_16M1067342
crossref_primary_10_1007_s10013_017_0257_8
crossref_primary_10_1007_s11228_012_0213_4
crossref_primary_10_1007_s11228_012_0214_3
crossref_primary_10_1007_s10957_013_0385_6
crossref_primary_10_1007_s10898_022_01222_3
crossref_primary_10_1007_s10479_011_0955_7
crossref_primary_10_1080_02331934_2019_1711085
crossref_primary_10_1080_02331934_2016_1237515
crossref_primary_10_1007_s11590_012_0527_z
crossref_primary_10_1007_s11228_025_00746_6
crossref_primary_10_1016_j_na_2014_04_022
crossref_primary_10_1080_10556788_2015_1121488
Cites_doi 10.1007/s10898-008-9336-4
10.1007/s10107-004-0569-9
10.1007/s10107-008-0249-2
10.1016/j.jmaa.2008.07.039
10.1023/A:1008746317549
10.1142/9789812777096
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2011
Copyright Taylor & Francis Group 2011
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2011
– notice: Copyright Taylor & Francis Group 2011
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
DOI 10.1080/02331930903531527
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
Aerospace Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4945
EndPage 591
ExternalDocumentID 2411444451
10_1080_02331930903531527
453616
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
ACGEJ
ACGFS
ACIWK
ACTCW
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGCQS
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CAG
CCCUG
CE4
COF
CS3
DKSSO
DU5
EBS
EJD
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
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~
07G
1TA
AAIKQ
AAKBW
AAYXX
ACAGQ
ACGEE
AEUMN
AGLEN
AGROQ
AHMOU
ALCKM
AMEWO
AMXXU
BCCOT
BPLKW
C06
CITATION
CRFIH
DMQIW
DWIFK
IVXBP
LJTGL
NUSFT
QCRFL
TAQ
TFMCV
TOXWX
UB9
UU8
V3K
V4Q
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c406t-ae92fd38544e5f9983d0c022a6e1659603023ac63ff8a7cb1592a10f541324103
IEDL.DBID TFW
ISICitedReferencesCount 36
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000290982600003&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 Thu Oct 02 07:04:13 EDT 2025
Mon Nov 10 02:56:24 EST 2025
Tue Nov 18 22:22:07 EST 2025
Sat Nov 29 06:01:38 EST 2025
Mon May 13 12:09:12 EDT 2019
Mon Oct 20 23:47:44 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c406t-ae92fd38544e5f9983d0c022a6e1659603023ac63ff8a7cb1592a10f541324103
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 880045736
PQPubID 27961
PageCount 17
ParticipantIDs proquest_miscellaneous_1429894297
proquest_journals_880045736
crossref_citationtrail_10_1080_02331930903531527
crossref_primary_10_1080_02331930903531527
informaworld_taylorfrancis_310_1080_02331930903531527
PublicationCentury 2000
PublicationDate 20110501
PublicationDateYYYYMMDD 2011-05-01
PublicationDate_xml – month: 05
  year: 2011
  text: 20110501
  day: 01
PublicationDecade 2010
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2011
Publisher Taylor & Francis Group
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis Group
– name: Taylor & Francis LLC
References CIT0010
CIT0001
Mordukhovich BS (CIT0006) 2006; 330
Durea M (CIT0003) 2006; 2
Ng KF (CIT0008) 2006; 17
CIT0002
CIT0004
CIT0007
CIT0009
References_xml – ident: CIT0001
  doi: 10.1007/s10898-008-9336-4
– ident: CIT0007
  doi: 10.1007/s10107-004-0569-9
– ident: CIT0002
  doi: 10.1007/s10107-008-0249-2
– volume: 2
  start-page: 487
  year: 2006
  ident: CIT0003
  publication-title: Pac. J. Optim.
– ident: CIT0004
  doi: 10.1016/j.jmaa.2008.07.039
– volume: 17
  start-page: 1154
  year: 2006
  ident: CIT0008
  publication-title: SIAM J. Optim.
– volume: 330
  volume-title: Vol. II: Applications, Grundlehren der Mathematischen Wissenschaften (A Series of Comprehensive Studies in Mathematics)
  year: 2006
  ident: CIT0006
– ident: CIT0009
  doi: 10.1023/A:1008746317549
– ident: CIT0010
  doi: 10.1142/9789812777096
SSID ssj0021624
Score 2.0436153
Snippet The aim of this article is to obtain necessary optimality conditions for Pareto minima in set-valued optimization problems. We employ a new method to derive...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 575
SubjectTerms Fréchet coderivative
generalized Fermat rules
Mathematical functions
Minima
Mordukhovich coderivative
openness
Optimization
Optimization techniques
Pareto optimality
Pareto optimum
Recovery
set-valued mappings
Studies
Title On some Fermat rules for set-valued optimization problems
URI https://www.tandfonline.com/doi/abs/10.1080/02331930903531527
https://www.proquest.com/docview/880045736
https://www.proquest.com/docview/1429894297
Volume 60
WOSCitedRecordID wos000290982600003&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/eLvHCXMwpV3NS8MwFA8yPOjBb7FOJYInodg2ST-OIhYPMj1M3a1kaQLC1smSiX--L206Nic76K3QpGnT997vveTl9xC6AgunUmKLu1AS-TSjwueCgV7JSBAKEC1rsufXx6TXSweD7Nnl5miXVmljaNUQRdS22io3H-o2I-4GYAYEh9gVBpAgFtmz5AD7Vi37-ds83ArjuqStbe1Dc9ruaf72hCVUWuIsXbHRNfDku_985T204zxOfNuIyD7akNUB2l7gITxE2VOF9WQscW7ttMHT2UhqDG-HtTS-5QOXJZ6AcRm7U5vY1aHRR-glv-_fPfiupoIvALqNz2UWqZKkjFLJFMRapAwE4DiPZRgzCGdsESEuYqJUyhMxBG8n4mGgGIAdgH1AjlGnmlTyBOFSBSW4WyUnTFKpMg4fVzKq4FJkJB16KGjntBCOcNzWvRgVYctL-nNWPHQ97_LRsG2saxws_qjC1EscqqlHstq8MF_GQ2xNF7JmqG4rBIXTcV2A5QN_OCGxhy7nd0E57Y4Lr-RkpiGuqgnuoyw5_ePIXbTVrGLbFMsz1DHTmTxHm-LTvOvpRS3w32om-Q8
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90CuqD3-KcHxF8Eoptk_TjUcShOKcPU_dWsjQBYetk7cQ_30s_xuZkD_pWaNKk6d397i7p7wAu0MLpgJriLoy6FguZtITkqFfKlZQhRKuc7Pm15bfbQbcbPpcJt7Q8VmliaF0QReS22ii3SUZXR-KuEGdQcqhJMaAIcddfhhWOOGu48zvNt0nA5Xh5UVvT3ML2rNrV_O0RM7g0w1o6Z6Vz6Glu_XfS27BZOp3kupCSHVhSyS5sTFER7kH4lJB0OFCkaUx1RkbjvkoJTo-kKrMMJbiKyRDty6D8cZOUpWjSfXhp3nZu7qyyrIIlEb0zS6jQ1TENOGOKawy3aGxLhHLhKcfjGNGYOkJCelTrQPiyhw6PKxxbc8Q7xHubHkAtGSbqEEis7Rg9rlhQrpjSocCXiznTeClDGvTqYFeLGsmSc9yUvuhHTkVN-nNV6nA56fJREG4samxPf6koy7McuihJMt88yr6yOvAFXeiCoRqVFESlmqcRGj90iX3q1eF8chf102y6iEQNxymGVjnHvRv6R38c-QzW7jqPrah1335owHqR1DYnLo-hlo3G6gRW5Wf2no5Oc-n_Bj0A_Tk
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD3-KcHxF8Eopdk_TjUdSiOKYPU_dWsjQBYevG2ol_vpd-jOlkD_pWaNKk6d397pLr7wAu0MJpn5riLow6FguYtITkqFfKkZQhRKuc7Pm15bXbfrcbPJe5OWmZVmliaF0QReS22ij3KNZVRtwVwgwKDjU7DChB3PGWYQXdZtcIeCd8m8ZbTTevaWuaW9ieVYeavz3iGyx9Iy2dM9I58oRb_5zzNmyWLie5LmRkB5ZUsgsbM0SEexA8JSQdDhQJjaHOyHjSVynB2ZFUZZYhBFcxGaJ1GZS_bZKyEE26Dy_hXefm3iqLKlgSsTuzhAocHVOfM6a4xmCLxrZEIBeuaroc4xlTRUhIl2rtC0_20N1xRNPWHNEO0d6mB1BLhok6BBJrO0Z_KxaUK6Z0IPDlYs40XsqA-r062NWaRrJkHDeFL_pRsyIm_bkqdbicdhkVdBuLGtuzHyrK8j0OXRQkmW8eZZ9ZHfiCLnTBUI1KCKJSydMITR86xB5163A-vYvaaY5cRKKGkxQDq5zh3gm8oz-OfAZrz7dh1HpoPzZgvdjRNumWx1DLxhN1AqvyI3tPx6e57H8BOCb76w
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=On+some+Fermat+rules+for+set-valued+optimization+problems&rft.jtitle=Optimization&rft.au=Durea%2C+M&rft.au=Strugariu%2C+R&rft.date=2011-05-01&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=60&rft.issue=5&rft.spage=575&rft.epage=591&rft_id=info:doi/10.1080%2F02331930903531527&rft.externalDBID=NO_FULL_TEXT
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