求解模糊线性规划问题的一种解法

A New Method of Solving Fuzzy Linear Programmings

本文首先建立一类模糊线性规划问题的对偶问题,利用求解对偶问题,得到原规划问题的最优解。由于将模糊向量转移到目标函数中去,因而初始可行基只计算一次,从而可压缩计算量,文中给出了一般计算步骤和数值例子,并对两种算法进行了比较,结果表明新算法计算量小。 文中还证明了原规划与对偶规划的最优判决相等。

At first, a kind of dual problems of linear programmings is established in this paper. By solving dual problems, we get the optimal sotmions of the original programmings. Because fuzzy vectors arc tranomit-ted into objective functions, the initial fearible basis is calculated only-once and thus it is possible to compress the calculation process. The general calcalation steps and numerical examples are given. The comprisen of both methods, which is given, shows that the new method employe less calculation than the othes one.It is proved in this paper that the optional decioion of the original programming is equal to that of dual programming.