摘要
利用Ｃｌａｒｋｅ广义梯度，对目标函数和约束函数都是不变凸的非光滑多目标规划问题给出最优性条件、广义鞍点定理以及广义的Ｍｏｎｄ－ｗｅｉｒ型对偶。
In this paper,optimality of non-smooth multi-objective programming is given in which the constraint functions are in rexity and their generalized saddle-point theorem, duality theorem are derived by using Clacke generalized gradient.
基金
国家自然科学基金
关键词
非光滑
多目标规划
最优化算法
non-smooth multi-objective programming
optimality condition
saddlepoint theorem
mond-wier-type dual
