{"title":"求解由Frank t -范数族定义的两个模糊关系不等式相交的线性优化问题的一种算法","authors":"A. Ghodousian","doi":"10.5121/IJFCST.2018.8301","DOIUrl":null,"url":null,"abstract":"Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated. The feasible region is formed as the intersection of two inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a necessary and sufficient condition and three other necessary conditions are presented to conceptualize the feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal objective value. Also, it is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can easily generate a feasible test problem and employ our algorithm to it.","PeriodicalId":270156,"journal":{"name":"International Journal in Foundations of Computer Science & Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Algorithm for Solving Linear Optimization Problems Subjected to the Intersection of Two Fuzzy Relational Inequalities Defined by Frank Family of T-Norms\",\"authors\":\"A. Ghodousian\",\"doi\":\"10.5121/IJFCST.2018.8301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated. The feasible region is formed as the intersection of two inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a necessary and sufficient condition and three other necessary conditions are presented to conceptualize the feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal objective value. Also, it is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can easily generate a feasible test problem and employ our algorithm to it.\",\"PeriodicalId\":270156,\"journal\":{\"name\":\"International Journal in Foundations of Computer Science & Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal in Foundations of Computer Science & Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5121/IJFCST.2018.8301\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal in Foundations of Computer Science & Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/IJFCST.2018.8301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
Frank t-norm是连续阿基米德t-norm的参数族,其成员也是严格函数。通常,这个t模族也被称为基本t模族因为它在一些应用中扮演着重要的角色。研究了一类具有模糊关系不等式约束的线性目标函数的优化问题。可行域是由frank t-范数族定义的两个不等式模糊系统的交集形成的,并将其视为模糊组合。首先,研究了用max-Frank组合定义两个模糊不等式系统的可行解集的解。其次,推导了一些相关的基本性质和理论性质。然后,给出了一个充分必要条件和另外三个必要条件来概念化问题的可行性。随后,证明了最优目标值的下界总是可以达到的。并证明了问题的最优解总是由可行域的唯一最大解和最小解得到的。最后,提出了一种求解该问题的算法,并给出了实例说明。此外,提出了一种生成随机可行max-Frank模糊关系不等式的方法。通过这种方法,我们可以很容易地生成一个可行的测试问题,并将我们的算法应用于该问题。
An Algorithm for Solving Linear Optimization Problems Subjected to the Intersection of Two Fuzzy Relational Inequalities Defined by Frank Family of T-Norms
Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated. The feasible region is formed as the intersection of two inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a necessary and sufficient condition and three other necessary conditions are presented to conceptualize the feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal objective value. Also, it is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can easily generate a feasible test problem and employ our algorithm to it.