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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization Ročník 62; číslo 6; s. 783 - 795
Hlavní autori: Golestani, M., Nobakhtian, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia Taylor & Francis Group 01.06.2013
Taylor & Francis LLC
Predmet:
constraint qualification
Inequalities
Mathematical analysis
multiobjective optimization
necessary conditions
nonsmooth analysis
Optimization
Programming
Qualifications
Studies
ISSN:0233-1934, 1029-4945
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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