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.
Liren HuangLulin TanChunguang Liu
Balendu Bhooshan UpadhyayArnav GhoshNader KanziH.M. Soroush
Balendu Bhooshan UpadhyayArnav GhoshSavin Treanţă