Optimality conditions for multiobjective programming problems with G-KKT-pseudoinvexity

The purpose of this paper is to establish characterizations for efficient solutions to multiobjective programming problems. We extend the concept of G-Karush-Kuhn-Tucker problems to the multiobjective programming case and introduce a new class of multiobjective programming problems, which is called G-KKT-pseudoinvex multiobjective programming problems. We show that the G-Karush-Kuhn-Tucker points to be efficient solutions, if and only if the multiobjective programming problem is G-KKT-pseudoinvex. Similarly, we also propose characterizations for efficient solutions by using G-Fritz-John optimality conditions. We establish an example in support of our investigation.