Abstract
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.
Acknowledgements
The second author was partially supported by the Center of Excellence for Mathematics, University of Shahrekord, Iran.