模糊线性规划问题的一种新的单纯形算法  

A New Simplex Algorithm for Fuzzy Linear Programming

作　　者：高培旺[1] 

机构地区：[1]中南大学铁道校区数理力学系,湖南长沙410075

出　　处：《模糊系统与数学》2002年第3期64-68,共5页Fuzzy Systems and Mathematics

摘　　要：提出求解模糊线性规划问题的一种新的思路 ,就是应用单纯形法先求解与 (FLP)相应的普通线性规划问题 ,通过模糊约束集与模糊目标集的隶属度的比较 ,获得两个集合交集的最优隶属度 ,将此最优隶属度代入最优单纯形表中 ,即可求得 (FLP)的解。本算法只需在一张适当的迭代表台上执行单纯形迭代过程 。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.

关 键 词：模糊线性规划 单纯形算法 线性规划 隶属度 

分 类 号：O221.1[理学—运筹学与控制论]