OPTIMALITY CONDITIONS FOR EFFICIENCY ON NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS

被引：12
|
作者：
Long, Xian-Jun [1 ]
Huang, Nan-Jing [2 ]
机构：
[1] Chongqing Technol & Business Univ, Coll Math & Stat, Chongqing 400067, Peoples R China
[2] Sichuan Univ, Dept Math, Chengdu 610064, Sichuan, Peoples R China
来源：
TAIWANESE JOURNAL OF MATHEMATICS | 2014年 / 18卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Optimality condition; Nonsmooth multiobjective programming; Efficient solution; Dini directional derivatives; Convexificators; Constraint qualification; OPTIMIZATION PROBLEMS; CONSTRAINT QUALIFICATIONS; GENERALIZED CONVEXITY; VECTOR OPTIMIZATION; SUBDIFFERENTIALS; CONVEXIFACTORS; CALCULUS;
D O I：
10.11650/tjm.18.2014.3730
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, a nonsmooth multiobjective programming problem is introduced and studied. By using the generalized Guignard constraint qualification, some stronger Kuhn-Tucker type necessary optimality conditions for efficiency in terms of convexificators are established, in which we are not assuming that the objective functions are directionally differentiable. Moreover, some conditions which ensure that a feasible solution is an efficient solution to nonsmooth multiobjective programming problems are also given. The results presented in this paper improve the corresponding results in the literature.
引用
收藏
页码：687 / 699
页数：13
相关论文
共 50 条
12345