Mathematics Department, Jilin University of Technology, Changchun 130025,China
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
折叠
NONSMOOTH MULTIOBJECTIVE PROGRAMMING
WANG Liancheng;DONG Jiali;LIU Qinghuai
Author information+
Mathematics Department, Jilin University of Technology, Changchun 130025,China
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
Collapse
文章历史+
收稿日期
修回日期
出版日期
1900-01-01
1900-01-01
1994-10-15
发布日期
1994-10-15
摘要
This paper considers the following nonsmooth multiobjective progrmming problem: (P) Weak min f(x) = (f1(x),…, fp(x)),s.t.- g(x) ∈ S, h(x) = 0, where x ∈ R^n, f(x) ∈ R^p, g(x) ∈ R^m, h(x) ∈ R', S\subset 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.
Abstract
This paper considers the following nonsmooth multiobjective progrmming problem: (P) Weak min f(x) = (f1(x),…, fp(x)),s.t.- g(x) ∈ S, h(x) = 0, where x ∈ R^n, f(x) ∈ R^p, g(x) ∈ R^m, h(x) ∈ R', S\subset 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.
WANG Liancheng
, DONG Jiali
, LIU Qinghuai. , {{custom_author.name_cn}}.
NONSMOOTH MULTIOBJECTIVE PROGRAMMING. 系统科学与复杂性(英文), 1994, 7(4): 362-366
WANG Liancheng
, DONG Jiali
, LIU Qinghuai. , {{custom_author.name_en}}.
NONSMOOTH MULTIOBJECTIVE PROGRAMMING. Journal of Systems Science and Complexity, 1994, 7(4): 362-366