Generalized convexity and nonsmooth problems of vector optimization
https://doi.org/10.1007/s10898-004-0998-2Publisher, magazine: ,
Publication year: 2005
Lưu Trích dẫn Chia sẻAbstract
In this paper it is shown that every generalized Kuhn-Tucker point of a vector optimization problem involving locally Lipschitz functions is a weakly efficient point if and only if this problem is KT- pseudoinvex in a suitable sense. Under a closedness assumption (in particular, under a regularity condition of the constraint functions) it is pointed out that in this result the notion of generalized Kuhn–Tucker point can be replaced by the usual notion of Kuhn–Tucker point. Some earlier results in (Martin (1985), The essence of invexity, J. Optim. Theory Appl., 47, 65–76. Osuna-Gómez et al., (1999), J. Math. Anal. Appl., 233, 205–220. Osuna-GGómez et al., (1998), J. Optim. Theory Appl., 98, 651–661. Phuong et al., (1995) J. Optim. Theory Appl., 87, 579–594) results are included as special cases of ours. The paper also contains characterizations of HC-invexity and KT- invexity properties which are sufficient conditions for KT- pseudoinvexity property of nonsmooth problems.
Tags: Invexity, Kuhn–Tucker condition, Nonsmooth function, Vector optimization
Các bài viết liên quan đến tác giả Phạm Hữu Sách
Efficiency and generalised convexity in vector optimisation problems
Hartley Proper Efficiency in Multifunction Optimization
Infine functions, nonsmooth alternative theorems and vector optimization problems.
New generalized convexity notion for set-valued maps and application to vector optimization
Characterizations of Hartley proper efficiency in nonconvex vector optimization
Reachability for discrete-time dynamical set-valued systems depending on a parameter
Characterization of scalar quasiconvexity and convexity of locally Lipschitz vector-valued maps
Generalized invexity and duality theories with multifunctions