Second order (F,?,?,d)-convexity and duality in multiobjective programming
A class of second order (F,?,?,d)-convex functions and their generalizations is introduced. Using the assumptions on the functions involved, weak, strong and strict converse duality theorems are established for a second order MondWeir type multiobjective dual.
multiobjective programming second order duality efficient solutions generalized (f ? d)-convexity