摘要
本文在更一般的凸性条件下,讨论了多目标规划中Kuhn—Tucker条件的充分性。特别指出了:对于等式约束函数不必像通常那样假定为线性的,在证明方法上也不必像通常那样依赖于单目标规划来处理。
In this paper, we discuss the sufficiency of Kuhn-Tucker conditions onmultiobjective programming under more general convexity conditions. Specia-lly point out that the epuality constraints are not necessarily linear, and theprove methods are not necessarily dependent on single objective programming.
关键词
多目标规划
K-T条件
等式约束函数
multiobjective programming
Kuhn-Tucuer conditions
equality constraints functions
f-convex functions
f-pseudo-convex functions
f-quasi-convex functions
efficient solutions
weak efficient solutions
