Journal of Inequalities and Applications
Volume 2010 (2010), Article ID 930457, 10 pages
Research Article

Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Division of Mathematical Sciences, Pukyong National University, Busan 608-737, South Korea

Received 29 October 2009; Accepted 15 February 2010

Academic Editor: Jong Kyu Kim

Copyright © 2010 Kwan Deok Bae et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.