Optimality Conditions for a Class Lipschitz Multiobjective Programming
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 quali.cation for a multiobjective programming in which all the objective functions and constraint functions are Lipschitz. Finally sufficient conditions are studied.
Optimality conditions generalized gradient separation theorem weak Pareto-efficient solution
Zhongfan Li Cailing Wang Wenjuan Sun
School of Mathematics , Jilin University, Changchun 130012, China School of Science, Shenyang Ligong University, Shenyang 110168 , China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
2834-2837
2009-06-17(万方平台首次上网日期,不代表论文的发表时间)