Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
Authors:
Xianjun Long
Affiliation:
1. College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing, 400067, China
Abstract:
In this paper, nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudounivex functions are introduced. By utilizing these new concepts, sufficient optimality conditions for a weakly efficient solution of the nonsmooth multiobjective programming problem are established. Weak and strong duality theorems are also derived for Mond-Weir type multiobjective dual programs.