| 线性约束多目标规划的非单调信赖域算法 |
| |
| 引用本文： | 彭叶辉,施保昌,姚升保.线性约束多目标规划的非单调信赖域算法[J].华中科技大学学报(自然科学版),2003,31(7):113-114. |
| |
| 作者姓名： | 彭叶辉 施保昌 姚升保 |
| |
| 作者单位： | 华中科技大学数学系 |
| |
| 摘 要： | 构造了一个解线性约束多目标优化问题的数值算法，该算法把一种非单调技巧与信赖域方法结合起来，从理论上分析，在一般条件下，算法全局收敛于问题的K—T点。
|
| 关 键 词： | 多目标规划 信赖域 非单调 |
| 文章编号： | 1671-4512(2003)07-0113-02 |
| 修稿时间： | 2002年5月10日 |
Nonmonotone trust region algorithm for linear constrained multiobjective programming |
| |
| Peng Yehui,Shi Baochang,Yao Shengbao.Nonmonotone trust region algorithm for linear constrained multiobjective programming[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2003,31(7):113-114. |
| |
| Authors: | Peng Yehui Shi Baochang Yao Shengbao |
| |
| Institution: | Peng Yehui Shi Baochang Yao Shengbao |
| |
| Abstract: | 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. |
| |
| Keywords: | multiobjective programming nonmonotone t rust region Peng Yehui Master Dept of Mathematiecs Huahong Univ of Sci & Tech Wuhan 430074 China |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
