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.

Abstract

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.