摘要
本文对双层多目标规划问题的数学模型给出一种新的解决方法,利用带满意度的ε-约束法和Kuhn-Tucker条件把双层多目标规划问题转化为单层单目标约束规划问题,当此约束集为紧集时,采用带权极大模理想点法求解此问题的弱有效解,通过分析人与决策人之间的交互,采用逐步宽容约束法检验此解的满意性。
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.
出处
《长春理工大学学报（自然科学版）》
2006年第2期112-115,120,共5页
Journal of Changchun University of Science and Technology(Natural Science Edition)
基金
吉林省科技厅项目(20040130)
关键词
双层多目标规划
满意度
宽容
bilevel multiobjective programming
satisfactoriness
tolerant
