| 求解双层多目标规划问题的一种方法 |
| |
| 引用本文： | 姜志侠,彭轩,成丽波.求解双层多目标规划问题的一种方法[J].长春理工大学学报,2006,29(2):112-115,120. |
| |
| 作者姓名： | 姜志侠 彭轩 成丽波 |
| |
| 作者单位： | 长春理工大学,理学院,长春,130022;长春税务学院,基础部,长春,130023 |
| |
| 基金项目： | 吉林省科技厅项目(20040130) |
| |
| 摘 要： | 本文对双层多目标规划问题的数学模型给出一种新的解决方法,利用带满意度的ε-约束法和Kuhn-Tucker条件把双层多目标规划问题转化为单层单目标约束规划问题,当此约束集为紧集时,采用带权极大模理想点法求解此问题的弱有效解,通过分析人与决策人之间的交互,采用逐步宽容约束法检验此解的满意性。
|
| 关 键 词： | 双层多目标规划 满意度 宽容 |
| 文章编号： | 1672-9870（2006）01-0112-04 |
| 收稿时间： | 2005-10-27 |
| 修稿时间： | 2005年10月27日 |
An Algorithm For Bilevel Multiobjective Programming Problem |
| |
| JIANG Zhixia,PENG Xuan,CHENG Libo.An Algorithm For Bilevel Multiobjective Programming Problem[J].Journal of Changchun University of Science and Technology,2006,29(2):112-115,120. |
| |
| Authors: | JIANG Zhixia PENG Xuan CHENG Libo |
| |
| Abstract: | In this paper,a new algorithm is given to solve a bilevel multiobjective programming with several decision makers interconnected based on the Stackelberg leader-follower game,and with the help of satisfactoriness and Kuhn-Tucker condition,the bilevel multiobjective programming problem is changed to a singular-level constraint programming problem,the maximal module ideal point algorithm with the power coefficient is given to solve it.And then,the analysis and decision makers interact and the gradual tolerant constraint algorithm is used to check the satisfactory of the solution. |
| |
| Keywords: | bilevel multiobjective programming satisfactoriness tolerant |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
