Abstract:

In this paper we are focused to study the nondiferentiable multiobjective programming problem. We start from the invexity proposed by H. Slimani and M.S. Radjef. They consider the invexity for a differentiable vector function when each component of function is invex with respect to its own function i h . We extend this concept to a general invexity class of r -invexity and moreover for this case we consider that the vector function is nondifferentiable. In this framework we investigate the optimality conditions and give some new theorems that state the sufficient conditions for a feasible point to be efficient.