A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations

IF 1.9 4区 数学 Q1 MATHEMATICS
Samaneh Aliannezhadi, Ali Abbasi Molai
{"title":"A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations","authors":"Samaneh Aliannezhadi, Ali Abbasi Molai","doi":"10.22111/IJFS.2021.5879","DOIUrl":null,"url":null,"abstract":"A geometric programming problem subject to bipolar max-product fuzzy relation equation constraints is studied in this paper. Some necessary and sufficient conditions are given for its solution existence. A lower and upper bound on the solution set of its feasible domain is obtained. Some sufficient conditions are proposed to determine some its optimal components without its resolution. A modified branch-and-bound method is extended to solve the problem. Moreover, an efficient algorithm is proposed to solve the problem based on the simplification operations and the modified branch-and-bound method. Its computational complexity is carefully analyzed. Some examples are given to show the importance of the problem and to illustrate the process of the algorithm. Finally, an analytic and comparative study is done to show the efficiency of the simplification procedures.","PeriodicalId":54920,"journal":{"name":"Iranian Journal of Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian Journal of Fuzzy Systems","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.22111/IJFS.2021.5879","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

Abstract

A geometric programming problem subject to bipolar max-product fuzzy relation equation constraints is studied in this paper. Some necessary and sufficient conditions are given for its solution existence. A lower and upper bound on the solution set of its feasible domain is obtained. Some sufficient conditions are proposed to determine some its optimal components without its resolution. A modified branch-and-bound method is extended to solve the problem. Moreover, an efficient algorithm is proposed to solve the problem based on the simplification operations and the modified branch-and-bound method. Its computational complexity is carefully analyzed. Some examples are given to show the importance of the problem and to illustrate the process of the algorithm. Finally, an analytic and comparative study is done to show the efficiency of the simplification procedures.
双极模糊关系方程约束下单项指数几何优化的新算法
研究了一类具有双极极大积模糊关系方程约束的几何规划问题。给出了其解存在的充分必要条件。得到了其可行域解集的下界和上界。给出了确定其最优分量的充分条件。提出了一种改进的分支定界法来解决这一问题。在此基础上,提出了一种基于简化运算和改进分支定界法的高效求解算法。仔细分析了其计算复杂度。举例说明了该问题的重要性,并说明了算法的过程。最后,通过分析和比较研究表明了简化过程的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.50
自引率
16.70%
发文量
0
期刊介绍: The two-monthly Iranian Journal of Fuzzy Systems (IJFS) aims to provide an international forum for refereed original research works in the theory and applications of fuzzy sets and systems in the areas of foundations, pure mathematics, artificial intelligence, control, robotics, data analysis, data mining, decision making, finance and management, information systems, operations research, pattern recognition and image processing, soft computing and uncertainty modeling. Manuscripts submitted to the IJFS must be original unpublished work and should not be in consideration for publication elsewhere.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信