One simple procedure to finding the best approximate solution for a particular fuzzy relational equation with max-min composition

摘要：

Fuzzy relational equations have played an important role in fuzzy modeling and applied to many practical problems. Most theories of fuzzy relational equations based on a premise that the solution set is not empty. However, this is often not the case in practical applications. Recently, Chakraborty et al. presented an efficient algorithm to solve the best approximate solution for the fuzzy relational equations, X o A = I, with max-min composition, where I denotes the identity matrix. In this paper, new theoretical results are proposed for solving this particular problem. Hence, one simple procedure can be presented to find the best approximate solution quickly. A numerical example is provided to illustrate the procedure.

作者: Yak-Kuen Wu Chia-Cheng Liu Yung-Yih Lur Sy-Ming Guu

作者单位: Department of Management and Information Technology Vanung University Taoyuan,Taiwan,R.O.C Department of Business Administration Yuan Ze Univercity Taoyuan,Taiwan,R.O.C

会议类型: 国际会议

会议名称: The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

会议地点: 黄山

会议语种:英文

页码: 141-144

在线出版日期: 2010-05-28（万方平台首次上网日期，不代表论文的发表时间）