Nonsmooth multiobjective programming and constraint qualifications

We consider a nonsmooth multiobjective programming problem with inequality and set constraints. By using the notion of convexificator, we extend the Abadie constraint qualification, and derive the strong Kuhn-Tucker necessary optimality conditions. Some other constraint qualifications have been gene...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization Jg. 62; H. 6; S. 783 - 795
Hauptverfasser: Golestani, M., Nobakhtian, S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Taylor & Francis Group 01.06.2013
Taylor & Francis LLC
Schlagworte:
constraint qualification
Inequalities
Mathematical analysis
multiobjective optimization
necessary conditions
nonsmooth analysis
Optimization
Programming
Qualifications
Studies
ISSN:0233-1934, 1029-4945
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a nonsmooth multiobjective programming problem with inequality and set constraints. By using the notion of convexificator, we extend the Abadie constraint qualification, and derive the strong Kuhn-Tucker necessary optimality conditions. Some other constraint qualifications have been generalized and their interrelations are investigated.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2012.679939