The Notion of V-r-Invexity in Differentiable Multiobjective Programming
Tadeusz Antczak · Journal of Applied Analysis · 2005
In this paper, a generalization of convexity, namely V - r -invexity, is considered in the case of nonlinear multiobjective programming problems where the functions involved are differentiable. The assumptions on Pareto solutions are relaxed by means of V - r -invex functions. Also some duality results are obtained for such optimization problems.