Second order symmetric duality for nondifferentiable multiobjective programming involving cones (Q2520001)

The authors formulate second order Mond-Weir type non-differentiable multiobjective symmetric dual problems with cone constraints over arbitrary closed convex cones. They establish weak, strong and converse duality theorems for weakly efficient solutions under the assumptions of second order invex and pseudo-invex functions. Similar results for Wolfe type symmetric duality are also given.