模糊网络最大流算法研究

将模糊数差值B~-A~视为模糊方程X~+A~=B~的解,进而探讨了模糊方程的求解问题,并基于目的规划理论,给出了模糊方程的广义解定义.运用目的规划的单纯型方法,得到了模糊方程广义解的计算公式及模糊方程广义解的若干性质.由模糊方程的广义解引申出了模糊数差值的定义.运用该定义将传统的网络最大流算法推广到模糊环境.结果表明,模糊数差值定义,克服了基于扩展原理意义下的模糊运算所产生的各种问题,解决了这些传统理论方法的拓展问题.     

求模糊关系方程一个极小解的算法

本文给出一种能寻找[0,1]格上模糊关系方程一个极小解的算法。该算法用最大解作为初始向量对定义在[0,1]格上解集非空的有限论域上模糊关系方程均能准确无误的求出一个极小解,我们分析了算法的复杂性并用算例进行了说明。     

一类直觉模糊关系线性规划的解

提出了一类目标函数为线性函数,约束是直觉模糊关系方程的最优化问题.这是一类非凸非光滑最优化问题,基于可行域的结构,给出了求全局最优解和最优值的一个算法,最后通过数值例子验证了算法的可行性.     

一种完备完全分配格上矩阵方程的求解方法

模糊理论已经在决策、模式识别、故障诊断、过程控制等许多方面得到了广泛应用，在这些应用问题求解中往往要遇到求解模糊关系方程。本文从完备完全分配格的角度给出了一种求解模糊关系方程极小解的完备解法，并用计算机实现了提出的算法，为实际问题求解计算机化打下了基础。     

同解的max-min合成模糊关系方程的系数矩阵

讨论[0,1]格上同解的max-min合成模糊关系方程的系数矩阵的描述问题。首先给出了方程A⊙x=b与C⊙x=b同解的一个充分条件,然后在该充分条件下给出同解方程的系数矩阵的描述及其算法。     

模糊关系方程

<正> 模糊关系方程是模糊数学的一个基本课题,近年来,国内外在这方面开展了许多研究工作,但至今还有不少问题没有得到比较理想的结果.本文讨论了一般模糊关系方程的求解问题,对一类最常见的模糊关系方程从理论上弄清了它的解集结构并给出了一种实际解法,从而使问题得到比较彻底的解决.     

sup-conjunctor合成模糊关系方程有惟一极小解的条件

讨论[0,1]格上sup-conjunctor合成模糊关系方程有惟一极小解与惟一解的问题。首先给出了sup-conjunctor合成模糊关系方程解集的性质及两个算子IT与LT.然后定义并给出了sup-conjunctor合成模糊关系方程的特征矩阵。最后通过特征矩阵给出sup-conjunctor合成模糊关系方程有惟一极小解与惟一解的充要条件。     

有偏估计在GPS快速定位数据处理中的应用研究

本文结合GPS双差观测方程的特点,针对其中的瓶颈问题,即整周模糊度的确定问题进行了研究.通过构造一种新的有偏估计--部分岭估计,有效地克服了模型的病态性,实际算例的结果表明该算法的计算速度快、正确率高.     

目标系数模糊型模糊关系线性规划

提出了目标系数模糊型模糊关系线性规划问题,这是传统模糊关系线性规划的扩展.以三角模糊数为例,基于它的一种排序方法给出了求解该类规划的一个算法.最后,为了说明算法的有效性给出了两个数值例子.     

模糊相似关系传递核获取算法

针对模糊相似关系传递核的获取问题进行研究.首先给出模糊相似关系传递核的一些基本性质.之后,利用这些性质构造了三个算法来获取可能为传递核的模糊等价关系.最后,通过实验比较并分析这三种算法在获取传递核时的能力.     

Fuzzy关系方程保守路径的直接算法

文［１］基于布尔矩阵的保守路径给出Ｆｕｚｚｙ关系方程极小解的准确解法，但该文关于特征矩阵的定义不确切，这导致有例外的例子出现。本文给出了特征矩阵的正确定义，并设计了计算布尔矩阵保守路径个数的直接解法，使得文［１］中的方法完善化。     

A modified algorithm for solving the proposed models by Ghodousian and Khorram and Khorram and Ghodousian

In this paper, we focus on the proposed algorithm for optimizing the linear function with fuzzy relation equation constraints regarding max-prod composition that it has been proposed by Ghodousian and Khorram [A. Ghodousian, E. Khorram, An algorithm for optimizing the linear function with fuzzy relation equation constraints regarding max-prod composition, Appl. Math. Comput. 178 (2006) 502–509]. Firstly, we show that the algorithm may not lead to the optimal solution in some cases. Secondly, we propose a new algorithm for solving the presented model by Ghodousian and Khorram (2006), as mentioned above. In fact, it modifies the presented algorithm in the Ghodousian and Khorram’s paper. Also, this algorithm is extended to the presented model by Khorram and Ghodousian [E. Khorram, A. Ghodousian, Linear objective function optimization with fuzzy relation equation constraints regarding max-av composition, Appl. Math. Comput. 173 (2006) 872–886.] with max-av composition. Finally, some numerical examples are given for illustrating the purposes.     

约束条件为加法-取小模糊关系系统的带权min-max规划

定义了目标函数为带权重的min-max规划,约束条件为加法-取小模糊关系不等式系统,研究此模糊关系规划问题的求解思路和方法。当此模糊关系系统相容时,给出了一个求解此模糊关系规划问题的新算法和例子。     

Eigenvector method,consistency test and inconsistency repairing for an incomplete fuzzy preference relation

In this paper, we extend the eigenvector method (EM) to priority for an incomplete fuzzy preference relation. We give a reasonable definition of multiplicative consistency for an incomplete fuzzy preference relation. We also give an approach to judge whether an incomplete fuzzy relation is acceptable or not. We develop the acceptable consistency ratio for an incomplete multiplicative fuzzy preference relation, which is simple and similar to Saaty’s consistency ratio (CR) for the multiplicative preference relation. If the incomplete fuzzy preference relation is not of acceptable consistency, we define a criterion to find the unusual and false element (UFE) in the preference relation, and present an algorithm to repair an inconsistent fuzzy preference relation until its consistency is satisfied with the consistency ratio. As a result, our improvement method cannot only satisfy the consistency requirement, but also preserve the initial preference information as much as possible. Finally, an example is illustrated to show that our method is simple, efficiency, and can be performed on computer easily.     

Matrix representation of a binary relation using fuzzy and artificial learning theory. An algorithm which uses the potential functions learning rule

One of the most significant problems in economic domain is the dispose of human preference and choice forecasting. Recently, the economists have focused their researches to use the fuzzy concepts and the artificial learning procedures in the theory of economic choice. This paper extends the work done in this direction and offers a new algorithm for finding the matrix representation of the fuzzy binary relation which describes a preference relation.     

An Algorithm for Solving Optimization Problems with One Linear Objective Function and Finitely Many Constraints of Fuzzy Relation Inequalities

An optimization model with one linear objective function and fuzzy relation equation constraints was presented by Fang and Li (1999) as well as an efficient solution procedure was designed by them for solving such a problem. A more general case of the problem, an optimization model with one linear objective function and finitely many constraints of fuzzy relation inequalities, is investigated in this paper. A new approach for solving this problem is proposed based on a necessary condition of optimality given in the paper. Compared with the known methods, the proposed algorithm shrinks the searching region and hence obtains an optimal solution fast. For some special cases, the proposed algorithm reaches an optimal solution very fast since there is only one minimum solution in the shrunk searching region. At the end of the paper, two numerical examples are given to illustrate this difference between the proposed algorithm and the known ones.     

Monomial geometric programming with fuzzy relation equation constraints

Monomials are widely used. They are basic structural units of geometric programming. In the process of optimization, many objective functions can be denoted by monomials. We can often see them in resource allocation and structure optimization and technology management, etc. Fuzzy relation equations are important elements of fuzzy mathematics, and they have recently been widely applied in fuzzy comprehensive evaluation and cybernetics. In view of the importance of monomial functions and fuzzy relation equations, we present a fuzzy relation geometric programming model with a monomial objective function subject to the fuzzy relation equation constraints, and develop an algorithm to find an optimal solution based on the structure of the solution set of fuzzy relation equations. Two numerical examples are given to verify the developed algorithm. Our numerical results show that the algorithm is feasible and effective.     

An approach to group choice with fuzzy preference relations

This paper presents an approach to group choice with fuzzy preference relations. The experts' judgements are presented as fuzzy preorder relations. As group choice we assume the nearest relation to these relations, in the sense of the Hamming distance. In this paper an algorithm for finding a preorder relation as an expression of group choice is given and a way is pointed out to find the best alternative on the basis of this group choice. Furthermore, the connection between the impossibility theorem of Arrow and this group choice is considered.     

Fuzzy矩阵Schein秩的计算复杂性

本文讨论Fuzzy矩阵Schein秩的计算复杂性问题,证明了它是一个"NP-完全问题".首先,刻画了交可分解的Puzzy关系的交分解解集.然后,从Fuzzy关系的交分解与广义分解之间的关系出发,给出了Fuzzy关系广义分解的算法.最后,从Fuzzy关系广义分解的角度来讨论Fuzzy矩阵的Schein秩.指出它与色数问题之间的关系,即Fuzzy矩阵的Schein秩等于由它生成的简单图的色数,从而证明了计算Fuzzy矩阵的Schein秩是一个"NP-完全问题".     

求模糊关系传递闭包的一种算法

根据模糊关系的传递性的特征,文章提出了利用相应的模糊矩阵求有限论域上模糊关系的传递闭包的一种计算方法,该算法可以加快获得传递闭包的速度。通过实例说明了该算法是简便、实用的。