Higher-order (F, alpha, rho, d)-convexity and symmetric duality in multiobjective programming
A pair of higher-order Wolfe type and Mond-Weir 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, alpha, rho, d)-convexity/pseudoconvexity assumptions. Special cases are also discussed to show that this paper extends some known results of the literature. (C) 2010 Elsevier Ltd. All rights reserved.
higher-order (f, alpha, rho, d)-convexity duality theorems higher-order symmetric duality cone constraints efficient solutions