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...
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
-
Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs
by: Bae KwanDeok, et al.
Published: (2010-01-01) -
Optimality Conditions in Nondifferentiable G-Invex Multiobjective Programming
by: Kim HoJung, et al.
Published: (2010-01-01) -
Optimality Conditions in Nondifferentiable G-Invex Multiobjective Programming
by: Do Sang Kim, et al.
Published: (2010-01-01) -
Higher order duality in multiobjective fractional programming problem with generalized convexity
by: Pankaj, et al.
Published: (2017-01-01) -
Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming
by: Ravi P. Agarwal, et al.
Published: (2011-01-01)