论文标题
线性编程问题的快速算法被加权平均模糊关系相等（WPM-FRE）约束
A fast algorithm for the linear programming problem constrained with the Weighted power mean-Fuzzy Relational Equalities (WPM-FRE)
论文作者
论文摘要
在本文中，研究了一个线性编程问题，其中可行区域被形成为模糊的关系平等（fre）的一种特殊类型。在这种类型的FRE中，模糊组成被视为加权均值均值操作员（WPM）。得出了可行区域的某些理论特性，还提出了一些必要和足够的条件，以确定问题的可行性。此外，提出了两个程序来简化问题。基于问题的某些结构特性，提出了一种算法以找到最佳解决方案，最后描述了一个示例以说明算法。
In this paper, a linear programming problem is investigated in which the feasible region is formed as a special type of fuzzy relational equalities (FRE). In this type of FRE, fuzzy composition is considered as the weighted power mean operator (WPM). Some theoretical properties of the feasible region are derived and some necessary and sufficient conditions are also presented to determine the feasibility of the problem. Moreover, two procedures are proposed for simplifying the problem. Based on some structural properties of the problem, an algorithm is presented to find the optimal solutions and finally, an example is described to illustrate the algorithm.
