NONSMOOTH MULTIOBJECTIVE PROGRAMMING

WANG Liancheng;DONG Jiali;LIU Qinghuai

系统科学与复杂性(英文) ›› 1994, Vol. 7 ›› Issue (4) : 362-366.

PDF(216 KB)
PDF(216 KB)
系统科学与复杂性(英文) ›› 1994, Vol. 7 ›› Issue (4) : 362-366.
论文

NONSMOOTH MULTIOBJECTIVE PROGRAMMING

    WANG Liancheng;DONG Jiali;LIU Qinghuai
作者信息 +

NONSMOOTH MULTIOBJECTIVE PROGRAMMING

    WANG Liancheng;DONG Jiali;LIU Qinghuai
Author information +
文章历史 +

摘要

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.

关键词

Nonsmooth multiobjective programming / wea

Key words

Nonsmooth multiobjective programming / weak minimum / necessary and sufficient condition

引用本文

导出引用
WANG Liancheng , DONG Jiali , LIU Qinghuai. NONSMOOTH MULTIOBJECTIVE PROGRAMMING. 系统科学与复杂性(英文), 1994, 7(4): 362-366
WANG Liancheng , DONG Jiali , LIU Qinghuai. NONSMOOTH MULTIOBJECTIVE PROGRAMMING. Journal of Systems Science and Complexity, 1994, 7(4): 362-366
PDF(216 KB)

110

Accesses

0

Citation

Detail

段落导航
相关文章

/