Optimality conditions for nonsmooth multiobjective programming
Yantai, Shandong（2008）
摘要
This paper considers the following nonsmooth multiobjective programming problem: (P) weak min f(x)=(f1(x), hellip, fp(x)), s.t. -g(x)isinS, h(x)=0, where xisinRn, f(x)isinRp, g(x)isinRm, h(x)isinRr, SsubRm 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.
更多查看译文
关键词
weak minimum,optimality conditions,mathematical programming,local lipschitz condition,lagrangian condition,closed convex cone,nonsmooth multiobjective programming,minimisation,mathematics,convex cone,programming,optimization,satisfiability,lipschitz condition,statistics
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要