Efficiency and generalized convex duality for multiobjective programs

Abstract The concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective non-linear programs. The results are obtained for convex functions, ϱ-convex (i.e., weakly convex and strongly convex) functions, and pseudoconvex functions. For the convex and ϱ-convex functions a Wolfe type of dual is formulated, while for the pseudoconvex and ϱ-convex functions, a Mond-Weir type dual is proposed.