摘要
从有限测度空间的集函数拟凸、伪凸、严格伪凸等概念出发，证明了集函数多目标规划有效解的充分性条件。
This paper presented the concepts of the differentiablc quasiconvex,pseudo-convex,strict pseudo-convex set functions in the finite measure space and obtained several sufficient conditions of efficient solutions for the multi-objective programming with differentiable generalized convex set functoin.
出处
《南昌大学学报（理科版）》
CAS
1999年第2期174-178,共5页
Journal of Nanchang University(Natural Science)
关键词
多目标规划
有效解
充分性条件
可微集函数
multiobjective programming,efficient solution,suffictient condition
