Non-differentiable symmetric duality for multiobjective programming with cone constraints

Two pairs of non-differentiable multiobjective symmetric dual problems with cone constraints over arbitrary cones, which are Wolfe type and Mond–Weir type, are considered. On the basis of weak efficiency with respect to a convex cone, we obtain symmetric duality results for the two pairs of problems under cone-invexity and cone-pseudoinvexity assumptions on the involved functions. Our results extend the results in Khurana S. Khurana, Symmetric duality in multiobjective programming involving generalized cone-invex functions, European Journal of Operational Research 165 (2005) 592–597] to the non-differentiable multiobjective symmetric dual problem.