Symmetric duality in multiobjective programming involving generalized cone-invex functions

In this paper, cone-pseudoinvex and strongly cone-pseudoinvex functions are defined. A pair of Mond-Weir type symmetric dual multiobjective programs is formulated over arbitrary cones. Weak duality, strong duality and converse duality theorems are established using the above-defined functions. A self-duality theorem is also given by assuming the functions involved to be skew-symmetric.