Higher-order (F,?,?,d) ( F , ? , ? , d ) -convexity and symmetric duality in multiobjective programming
A pair of higher-order Wolfe type and MondWeir type multiobjective symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are then established using the notion of higher-order (F,?,?,d) ( F , ? , ? , d ) -convexity/pseudoconvexity assumptions. Special cases are also discussed to show that this paper extends some known results of the literature.
? ? ? ? ? ? ? ? ? ? ? ? ? ? d ) duality theorems higher-order symmetric duality cone constraints higher-order (f d) ( f d ) -convexity (f d ) (f d ) ( f efficient solutions