Optimality conditions for a class Lipschitz multiobjective programming
Guilin（2009）
摘要
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.
更多查看译文
关键词
optimality condition,optimisation,multiobjective programming,necessary optimality condition,new constraint qualification,separation theorem,constraint function,distance function,optimality conditions,generalized gradient,objective functions,objective function,weak pareto-efficient solution,inequality systems,inequality system,set theory,sufficient condition,class lipschitz multiobjective programming,constraint functions,mathematics,optimization,programming,silicon,data mining,probability density function,functional programming,convergence
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要