Duality and a Characterization of Pseudoinvexity for Pareto and Weak Pareto Solutions in Nondifferentiable Multiobjective Programming
In this paper, we unify recent optimality results under directional derivatives by the introduction of new pseudoinvex classes of functions, in relation to the study of Pareto and weak Pareto solutions for nondifferentiable multiobjective programming problems. We prove that in order for feasible solutions satisfying Fritz John conditions to be Pareto or weak Pareto solutions, it is necessary and sufficient that the nondifferentiable multiobjective problem functions belong to these classes of functions, which is illustrated by an example. We also study the dual problem and establish weak, strong, and converse duality results.
duality pseudoinvexity weak pareto solutions multiobjective programming fritz john optimality conditions