Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity

Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity

0.00 Avg rating0 Votes
Article ID: iaor200971265
Country: Netherlands
Volume: 45
Issue: 2
Start Page Number: 319
End Page Number: 334
Publication Date: Oct 2009
Journal: Journal of Global Optimization
Authors:
Keywords: duality, invexity
Abstract:

In the paper, we consider a class of nonsmooth multiobjective programming problems in which involved functions are locally Lipschitz. A new concept of invexity for locally Lipschitz vector-valued functions is introduced, called V-r-invexity. The generalized Karush–Kuhn–Tuker necessary and sufficient optimality conditions are established and duality theorems are derived for nonsmooth multiobjective programming problems involving V-r-invex functions (with respect to the same function η).

Reviews

Required fields are marked *. Your email address will not be published.