Symmetric duality for a class of multiobjective programming (original) (raw)
Related papers
A note on higher-order nondifferentiable symmetric duality in multiobjective programming
Applied Mathematics Letters, 2011
In this work, we establish a strong duality theorem for Mond–Weir type multiobjective higher-order nondifferentiable symmetric dual programs. This fills some gaps in the work of Chen [X. Chen, Higher-order symmetric duality in nondifferentiable multiobjective programming problems, J. Math. Anal. Appl. 290 (2004) 423–435].
Second order symmetric duality in nondifferentiable multiobjective programming
Information Sciences, 2005
A pair of Mond-Weir type second order symmetric nondifferentiable multiobjective programs is formulated. Weak, strong and converse duality theorems are established under g-pseudobonvexity assumptions. Special cases are discussed to show that this paper extends some work appeared in this area.
Second-order symmetric duality in multiobjective programming
Applied Mathematics Letters, 2001
pair of second-order symmetric dual models for multiobJective nonlinear programmmg 1s proposed m this paper We prove the weak, strong, and converse duality theorems for the formulated second-order symmetric dual programs under mvexity condltlons
Second Order Duality in Multiobjective Programming
Journal of Applied Analysis, 2008
A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.
Duality in Multiobjective Optimization Problems with Set Constraints
We propose four different duality problems for a vector optimization program with a set constraint, equality and inequality constraints. For all dual problems we state weak and strong duality theorems based on different generalized concavity assumptions. The proposed dual problems provide a unified framework generalizing Wolfe and Mond-Weir results.
Applied Mathematics, 2011
In this paper, we introduce a new class of generalized d I-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction d i for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficient under the generalised d I-univexity requirements. Moreover, weak, strong and strict converse duality theorems are also derived for Mond-Weir type dual programs.