Second order symmetric duality in nondifferentiable multiobjective programming
A pair of MondWeir type second order symmetric nondifferentiable multiobjective programs is formulated. Weak, strong and converse duality theorems are established under ?-pseudobonvexity assumptions. Special cases are discussed to show that this paper extends some work appeared in this area.
?-pseudobonvexity nondifferentiable programming multiobjective symmetric duality efficient solutions properly efficient solutions