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

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 62; no. 6; pp. 783 - 795
Main Authors: Golestani, M., Nobakhtian, S.
Format: Journal Article
Language:English
Published: Philadelphia Taylor & Francis Group 01.06.2013
Taylor & Francis LLC
Subjects:
constraint qualification
Inequalities
Mathematical analysis
multiobjective optimization
necessary conditions
nonsmooth analysis
Optimization
Programming
Qualifications
Studies
ISSN:0233-1934, 1029-4945
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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