首页 | 本学科首页   官方微博 | 高级检索  
     

灰色二层多目标线性规划问题及其解法
引用本文:郭欢 肖新平 Jeffrey Forrest.灰色二层多目标线性规划问题及其解法[J].控制与决策,2014,29(7):1193-1198.
作者姓名:郭欢  肖新平  Jeffrey  Forrest
作者单位:1. 武汉理工大学理学院,武汉430063;
2. 江汉大学数学与计算机科学学院,武汉430056;
3. 宾州州立SR 大学数学系,匹兹堡16057.
基金项目:

高等学校博士学科点专项科研基金项目(20120143110001);武汉理工大学国际交流预研项目(2012-JL-06).

摘    要:针对二层多目标线性规划问题,结合灰色系统的特性,提出了一般灰色二层多目标线性规划问题,并给出了模型的相关定义和定理.针对漂移型灰色二层多目标线性规划问题,提出一种具有全局收敛性质的求解算法.首先通过线性加权模理想点法把多目标转化为单目标;然后当可行域为非空紧集时,利用库恩塔克条件把双层转化为单层,再利用粒子群算法搜索单目标单层线性规划即可得到原问题的解;最后通过算例表明了该算法的有效性.

关 键 词:灰色系统  二层多目标规划  理想点法  库恩塔克条件  粒子群算法
收稿时间:2013/5/13 0:00:00
修稿时间:2013/10/21 0:00:00

Problem of grey bilevel multi-objective linear programming and its algorithm
GUO Huan XIAO Xin-ping Jeffrey Forrest.Problem of grey bilevel multi-objective linear programming and its algorithm[J].Control and Decision,2014,29(7):1193-1198.
Authors:GUO Huan XIAO Xin-ping Jeffrey Forrest
Abstract:

Based on the bilevel multi-objective linear programming and the characteristic of grey system, the general gray bilevel multi-objective linear programming problem with its relevant definition and theorem are given. A globally convergent algorithm is given to solve the drifting grey bilevel multi-objective linear programming problem. Firstly, multi-objective programming is transformed into single programming by using linear plus power ideal point algorithm. Then, the grey bilevel linear programming can be transformed into a grey linear programming problem by its Kuhn-Tucker condition when the feasible domain is nonempty compact aggregate. So these problems can be solved by using the particle swarm optimization algorithm to obtain the solution of the gray bilevel multi-objective linear programming problem. Finally, an example shows the effectiveness of the proposed algorithm.

Keywords:

grey system|bilevel multi-objective programming|ideal point algorithm|Kuhn-Tucker condition|particle swarm optimization

本文献已被 CNKI 等数据库收录!
点击此处可从《控制与决策》浏览原始摘要信息
点击此处可从《控制与决策》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号