Multiobjective second-order mixed symmetric duality with a square root term

In this paper, we have formulated a second-order mixed symmetric dual programs for a class of nondifferentiable multiobjective programming problem. Weak, strong and converse duality theorems are then proved for the aforementioned pair using the notion of second-order F-convexity/pseudoconvexity assumptions. Further, special cases are discussed to show that this paper extends some known results of the literature.