%0 Journal Article
%T Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs
%A Kwan Deok Bae
%A Young Min Kang
%A Do Sang Kim
%J Journal of Inequalities and Applications
%D 2010
%I Springer
%R 10.1155/2010/930457
%X We introduce nondifferentiable multiobjective programming problems involving the support function of a compact convex set and linear functions. The concept of (properly) efficient solutions are presented. We formulate Mond-Weir-type and Wolfe-type dual problems and establish weak and strong duality theorems for efficient solutions by using suitable generalized convexity conditions. Some special cases of our duality results are given.
%U http://dx.doi.org/10.1155/2010/930457