Unified higher order duality in nondifferentiable multiobjective programming involving cones

In this paper, a unified higher order dual is formulated for a nondifferentiable multiobjective programming problem, where every component of the objective function contains a term involving the support function of a compact convex set. Results about duality are presented under more suitable conditions. This higher order symmetric dual formulation unifies the symmetric dual formulations in the literature.