摘要
构造了一个解线性约束多目标优化问题的数值算法 .该算法把一种非单调技巧与信赖域方法结合起来 .从理论上分析 ,在一般条件下 ,算法全局收敛于问题的K
An algorithm was proposed for linear constrained mult io bjective programming. This algorithm is a trust region algorithm combined with a kind of nonmonotone technique. The theoretical analysis shows the algorithm is global convergent to the K-T point under common condition.
出处
《华中科技大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2003年第7期113-114,共2页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
关键词
多目标规划
信赖域
非单调
multiobjective programming
nonmonotone
t rust region Peng Yehui Master
Dept. of Mathematiecs, Huahong Univ. of Sci. & Tech., Wuhan 430074, China.