| 模糊线性规划问题的一种新的单纯形算法 |
| |
| 引用本文： | 高培旺.模糊线性规划问题的一种新的单纯形算法[J].模糊系统与数学,2002,16(3):64-68. |
| |
| 作者姓名： | 高培旺 |
| |
| 作者单位： | 中南大学,铁道校区,数理力学系,湖南,长沙,410075 |
| |
| 摘 要： | 提出求解模糊线性规划问题的一种新的思路 ,就是应用单纯形法先求解与 (FLP)相应的普通线性规划问题 ,通过模糊约束集与模糊目标集的隶属度的比较 ,获得两个集合交集的最优隶属度 ,将此最优隶属度代入最优单纯形表中 ,即可求得 (FLP)的解。本算法只需在一张适当的迭代表台上执行单纯形迭代过程 ,简捷方便适用
|
| 关 键 词： | 线性规划 单纯形法 模糊线性规划 隶属度 |
| 文章编号： | 1001-7402(2002)03-0064-05 |
| 修稿时间： | 2001年12月24 |
A New Simplex Algorithm for Fuzzy Linear Programming |
| |
| GAO Pei-wang.A New Simplex Algorithm for Fuzzy Linear Programming[J].Fuzzy Systems and Mathematics,2002,16(3):64-68. |
| |
| Authors: | GAO Pei-wang |
| |
| Abstract: | This paper presents a new thought of solving fuzzy linear programming,which the associated linear programming problem is firstly solved by the simplex method; Then, through comparing the membership degrees of fuzzy constraints set and fuzzy objective set an optimal one to the intersection of both is obtained; Finally, the solution to (FLP) would be achieved by substituting the optimal membership degree into the optimum simplex tableau. The algorithm is simple, convenient and applicable. |
| |
| Keywords: | Linear Programming Simplex Method Fuzzy Linear Programming |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
