Journal of Applied Analysis 11 (2005), No. 1, 063--079
Copyright Heldermann Verlag 2005
The Notion of V-r-Invexity in Differentiable Multiobjective Programming
Tadeusz Antczak
Faculty of Mathematics, University of Lódz, Banacha 22, 90-238 Lódz, Poland
antczak@math.uni.lodz.pl
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.
Keywords: Multiobjective programming, (weak) Pareto optimal solution, strictly V-r-invex function with respect to η, optimality conditions, duality.
MSC: 90C29, 26B25, 90C26
[ Fulltext-pdf (216 KB)] for subscribers only.