Sufficiency and Duality in Multiobjective Programming Involving Generalized Ž F, .-Convexity

New classes of generalized ŽF, .-convexity are introduced for vector-valued functions. Examples are given to show their relations with ŽF, .-pseudoconvex, ŽF, .-quasiconvex, and strictly ŽF, .-pseudoconvex vector-valued functions. The sufficient optimality conditions and duality results are obtained for multiobjective programming involving generalized ŽF, .-convex vector-valued functions