|
Abstract
|
In this paper, for a non-differentiable multiobjective generalized semi-infinite programming problem, where the objective and constraint functions are convex, the lower-level Basic and Slater constraint qualifications are given. Then, some necessary optimality conditions are derived at properly efficient solutions of the considered problem, under these constraint qualifications and using convex subdifferential.
|