Optimality Conditions for Nonsmooth Multiobjective Programming

被引：2
|
作者：
Wang, Cailing [1 ]
Zhang, You [2 ]
Sun, Wenjuan [3 ]
机构：
[1] Jilin Univ, Sch Math, Changchun 130012, Peoples R China
[2] Northeast Normal Univ, Sch Math & Stat, Changchun 130024, Peoples R China
[3] Shenyang Ligong Univ, Sch Sci, Shenyang 110168, Peoples R China
来源：
2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11 | 2008年
关键词：
Nonsmooth multiobjective programming; weak minimum; optimality conditions;
D O I：
10.1109/CCDC.2008.4597886
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper considers the following nonsmooth multiobjective programming problem: (P) Weak min f(x) = (f(1)(x), ..., f(p)(x)), s.t. - g(x) is an element of S, h(x) = 0, where x E R-n, f(x) is an element of R-p, g(x) is an element of R-m, h(x) E R-r, S subset of R-m is a closed convex cone with interior, and f, g, h satisfy the local Lipschitz condition. The necessary Lagrangian condition is established for a weak minimum of (P), and the proof is different from the proofs given by B.D.Craven, Ying Meiqian and other authors. Necessary conditions of Kuhn-Tucker type are obtained and sufficient conditions are discussed.
引用
收藏
页码：3049 / +
页数：2
相关论文
共 50 条
12345