Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Kwan Deok Bae, Young Min Kang, Do Sang Kim · Journal of Inequalities and Applications · 2010

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.

Read the paper · More papers on PaperTik