Higher-order symmetric duality in multiobjective programming problems under higher-order invexity

In this paper we present a pair of Wolfe and Mond–Weir type higher‐order symmetric dual programs for multiobjective symmetric programming problems. Different types of higher‐order duality results (weak, strong and converse duality) are established for the above higher‐order symmetric dual programs under higher‐order invexity and higher‐order pseudo‐invexity assumptions. Also we discuss many examples and counterexamples to justify our work.