Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions

A pair of Mond–Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K – F -convexity assumptions. Our results generalize several known results in the literature.