Counterexample and optimality conditions in differentiable multiobjective programming (Q5942350)

By giving a simple counterexample the authors show that the sufficient optimality conditions for Pareto optimal solutions of differentiable multiobjective programming problems (MOP) stated in Majundar (1997) are not correct in general. Modifications of the above mentioned results are developed based on the assumption that the functions involved at a (weak) Pareto optimal solution are convex, pseudoconvex and quasiconvex, respectively. In particular, in the modification of the sufficient optimality theorem for a Pareto optimal solution of (MOP), the assumption of pseudoconvexity of the objective functions is replaced by strict pseudoconvexity.