{"title":"一类具有最大-最小组合的特殊模糊关系方程的最佳近似解的一个简单方法","authors":"Yak-Kuen Wu, Chia-Cheng Liu, Yung-Yih Lur, S. Guu","doi":"10.1109/CSO.2010.19","DOIUrl":null,"url":null,"abstract":"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, XoA=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.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"One Simple Procedure to Finding the Best Approximate Solution for a Particular Fuzzy Relational Equation with Max-min Composition\",\"authors\":\"Yak-Kuen Wu, Chia-Cheng Liu, Yung-Yih Lur, S. Guu\",\"doi\":\"10.1109/CSO.2010.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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, XoA=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.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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, XoA=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.