模糊关系方程组supj∈mT(a_(ij),x_j)=bi,i∈n的解  

Solution Set of a System of Fuzzy Relational Equations with sup-T Composition

作　　者：张迪 王学平[1] ZHANG Di;WANG Xue-ping(Institute of Mathematics and Software Science,Sichuan Normal University,Chengdu 610066,China)

机构地区：[1]四川师范大学数学与软件科学学院,四川成都610066

出　　处：《模糊系统与数学》2018年第4期106-109,共4页Fuzzy Systems and Mathematics

基　　金：国家自然科学基金资助项目(11171242)

摘　　要：本文讨论[0,1]上sup-T合成模糊关系方程组的解集。这里,T为阿基米德t-模。首先给出方程组解集非空的充分必要条件,然后利用阿基米德t-模的加法生成子t描述了方程组的最大解和极小解,证明方程组解集不空时每个解有极小解,最后描述了方程组的解集。This paper deals with the solution set of a system of fuzzy relational equations with sup-T composition on [0,1] where T is Archimedean. It first gives a sufficient and necessary condition that the solution set is nonempty, and a condition that there exists a minimal element in the solution set. Then it proves that every solution has a minimal one when the solution set is nonempty. Finally, this paper describes the solution set.

关 键 词：模糊关系方程组 阿基米德t-模 加法生成子 极小解 解集 

分 类 号：O159[理学—数学]