Volume 7
Number 1
pp. 83-95

Lipschitz B-preinvex functions and nonsmooth multiobjective programming
Xian-Jun Long and Nan-Jing Huang

Abstract
In this paper, a class of B-preinvex functions introduced by Bector et al. \cite{BSL} are considered. Necessary and sufficient conditions, under which a locally Lipschitz function is B-preinvex, are established in terms of the Clarke subdifferentiable. Moreover, a sufficient optimality condition of efficient solution for a nonsmooth multiobjective programming problem involving B-preinvex functions is obtained. Finally, weak and strong duality theorems are proved for Mond-Weir type dual under B-preinvexity assumption.

Key words Mathematices Subject Classification
B-preinvex function, regularity, nonsmooth multiobjective programming, efficient solution, optimality condition, duality 90C26, 90C29, 90C46
ONLINE SUBSCRIPTION (Institutional Subscription Only)
Reference

Copyright© 2011 Yokohama Publishers For Editor For Authors