A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with [formula omitted]-invex functions

Abstract

In this paper, the so-called η -approximation approach is used to characterize solvability (in Pareto sense) of a nonlinear multiobjective programming problem with G -invex functions with respect to the same function η . In this method, an equivalent η -approximated vector optimization problem is constructed by a modification of both the objective and the constraint functions in the original multiobjective programming problem at the given feasible point. Moreover, in order to find a (weak) Pareto optimal solution in the original multiobjective problem, it is sufficient to solve its associated η -approximated vector optimization problem equivalent to the original multiobjective programming problem in the sense discussed in this paper.