Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

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...

Full description

Bibliographic Details
Main Authors: Kwan Deok Bae, Young Min Kang, Do Sang Kim
Format: Article
Language:English
Published: SpringerOpen 2010-01-01
Series:Journal of Inequalities and Applications
Online Access:http://dx.doi.org/10.1155/2010/930457

Similar Items