Optimality Conditions in Differentiable Multiobjective Programming

In this paper, three sufficient conditions are given, one of which modifies the previous result given by Singh (Ref. 1) under the assumption of convexity of the functions involved at the Pareto-optimal solution. A counterexample has been furnished which shows that the convexity assumption cannot be extended to include the quasiconvexity case. The second theorem on sufficiency requires the strict pseudoconvexity of the functions involved.