OPTIMALITY CONDITIONS IN NONSMOOTH MULTIOBJECTIVE PROGRAMMING  

作　　者：WANG Liancheng DONG Jiali LIU Qinghuai (Depertment of Mathematics, Jilin University of Technology, Changchun 130025, China) 

出　　处：《Systems Science and Mathematical Sciences》1994年第3期250-255,共6页

摘　　要：ＯＰＴＩＭＡＬＩＴＹＣＯＮＤＩＴＩＯＮＳＩＮＮＯＮＳＭＯＯＴＨＭＵＬＴＩＯＢＪＥＣＴＩＶＥＰＲＯＧＲＡＭＭＩＮＧ￥ＷＡＮＧＬｉａｎｃｈｅｎｇ；ＤＯＮＧＪｉａｌｉ；ＬＩＵＱｉｎｇｈｕａｉ（ＤｅｐｅｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＵｎｉ...In this paper, a separation theorem is established firstly. Applying this theorem the relationships between the solutions of a series of inequality systems are discussed.Then a necessary optimality condition without distance function is obtained under a new constraint qualification for a multiobjective programming in which all the objective functions and constraint functions are Lipschitz. Finally sufficient conditions are studied.

关 键 词：MULTIOBJECTIVE PROGRAMMING generalized gradient separation THEOREM WEAK Pareto-efficient solution. 

分 类 号：O221.3[理学—运筹学与控制论]