Optimality conditions for efficiency on nonsmooth multiobjective programming problems. (English) Zbl 1357.90133
Summary: A nonsmooth multiobjective programming problem is introduced and studied. By using the generalized Guignard constraint qualification, some stronger Kuhn-Tucker type necessary optimality conditions for efficiency in terms of convexificators are established, in which we are not assuming that the objective functions are directionally differentiable. Moreover, some conditions which ensure that a feasible solution is an efficient solution to nonsmooth multiobjective programming problems are also given. The results presented in this paper improve the corresponding results in the literature.
MSC:
90C29 | Multi-objective and goal programming |
90C48 | Programming in abstract spaces |
49J52 | Nonsmooth analysis |