Finding Minimal Solution to Generalized Min-Max Programming Problem With Addition-Min Composition
In order to describe the data transmission mechanism in the BitTorrent-like peer-to-peer file-sharing system, the addition-min fuzzy relation inequality system is introduced. At the same time, in order to distinguish the different importance of different terminals, the generalized min-max programmin...
Saved in:
| Published in | IEEE access Vol. 12; pp. 145174 - 145187 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
IEEE
2024
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2169-3536 2169-3536 |
| DOI | 10.1109/ACCESS.2024.3467191 |
Cover
Loading…
| Abstract | In order to describe the data transmission mechanism in the BitTorrent-like peer-to-peer file-sharing system, the addition-min fuzzy relation inequality system is introduced. At the same time, in order to distinguish the different importance of different terminals, the generalized min-max programming problem under the addition-min fuzzy relation inequality is proposed and studied. On the premise of ensuring that the quality level of data transmission meets all users, the minimal optimal solution can better avoid network congestion and improve the stability of data transmission. In this paper, we present how to find a minimal optimal solution to generalized min-max programming problems with addition-min composition. Firstly, some properties of the maximum optimal solution for the generalized min-max programming problem with addition-min combination are given. Then, by using the maximum optimal solution, the minimal optimal solution of the original problem is obtained by finding the minimal solution of the simplified constraint inequality. Moreover, convexity of the optimal solution set and the number of minimal optimal solutions are discussed. Finally, we propose an algorithm for finding the minimal optimal solution of the generalized min-max programming problem. Some examples are given to illustrate the feasibility and efficiency of the algorithm. |
|---|---|
| AbstractList | In order to describe the data transmission mechanism in the BitTorrent-like peer-to-peer file-sharing system, the addition-min fuzzy relation inequality system is introduced. At the same time, in order to distinguish the different importance of different terminals, the generalized min-max programming problem under the addition-min fuzzy relation inequality is proposed and studied. On the premise of ensuring that the quality level of data transmission meets all users, the minimal optimal solution can better avoid network congestion and improve the stability of data transmission. In this paper, we present how to find a minimal optimal solution to generalized min-max programming problems with addition-min composition. Firstly, some properties of the maximum optimal solution for the generalized min-max programming problem with addition-min combination are given. Then, by using the maximum optimal solution, the minimal optimal solution of the original problem is obtained by finding the minimal solution of the simplified constraint inequality. Moreover, convexity of the optimal solution set and the number of minimal optimal solutions are discussed. Finally, we propose an algorithm for finding the minimal optimal solution of the generalized min-max programming problem. Some examples are given to illustrate the feasibility and efficiency of the algorithm. |
| Author | Qin, Zejian Zhou, Xuegang |
| Author_xml | – sequence: 1 givenname: Xuegang orcidid: 0000-0001-7425-0748 surname: Zhou fullname: Zhou, Xuegang organization: School of Finance Mathematics and Statistics, Guangdong University of Finance, Guangzhou, Guangdong, China – sequence: 2 givenname: Zejian orcidid: 0000-0003-2903-0249 surname: Qin fullname: Qin, Zejian email: 735692885@qq.com organization: School of Finance Mathematics and Statistics, Guangdong University of Finance, Guangzhou, Guangdong, China |
| BookMark | eNpNkF9LwzAUxYNMcM59An3oF-jMvybN4yjbHGwoTPExpM3tzGibkVZQP73tJrL7kpOT-zuQc4tGjW8AoXuCZ4Rg9TjPssVuN6OY8hnjQhJFrtCYEqFiljAxutA3aNq2B9xP2luJHCOzdI11zT7ausbVpop2vvrsnG-izkcraCCYyv2AHd7jrfmKXoLfB1PXA9PrvII6enfdRzS31g1g3G9Gma-Pvj3d79B1aaoWpn_nBL0tF6_ZU7x5Xq2z-SYuGCNdnDCgzOZY8tQYAjkuUmxkTjnBiUww49RKCra0BeUqYXkp0pIVSW5kmYDp9QStz7nWm4M-hv434Vt74_TJ8GGvTehcUYHGBcEiTUFSZbkoICdKpKZkHErGQPE-i52ziuDbNkD5n0ewHkrX59L1ULr-K72nHs6UA4ALQihMhWS_VVmAYQ |
| CODEN | IAECCG |
| Cites_doi | 10.1007/s10700-021-09377-6 10.1016/0022-247X(91)90222-L 10.1007/s10700-021-09371-y 10.1007/s10700-019-09305-9 10.1007/s10700-019-09306-8 10.1016/j.ins.2015.07.015 10.1016/j.fss.2014.04.007 10.1109/TFUZZ.2016.2598367 10.1109/TFUZZ.2020.2991304 10.1007/s10700-011-9100-y 10.1016/j.ins.2011.04.042 10.1016/S0019-9958(76)90446-0 10.1016/j.ins.2007.10.010 10.1016/j.ins.2011.09.030 10.1016/j.cie.2020.106644 10.1016/j.ins.2020.03.047 10.1109/FSKD.2012.6233956 10.1016/j.fss.2017.04.002 10.3233/IFS-151546 10.1109/TFUZZ.2015.2428716 10.1109/TFUZZ.2002.806322 10.1016/j.fss.2009.01.012 10.1016/S0165-0114(86)80076-8 10.1007/s40815-018-0530-3 10.1016/0165-0114(84)90084-8 10.1016/j.ins.2011.04.011 10.1016/j.fss.2004.09.010 10.1007/s10700-008-9029-y 10.1007/s10700-009-9059-0 10.1016/S0165-0114(98)00417-5 10.1109/TFUZZ.2016.2593496 10.1016/j.fss.2022.03.017 10.1016/j.cie.2014.03.024 10.1109/TFUZZ.2002.800657 10.1016/j.ins.2011.03.004 10.1109/91.784204 10.1016/0165-0114(82)90043-4 10.1016/j.ins.2007.04.006 10.1016/j.fss.2022.02.005 10.1016/j.ins.2008.05.030 10.1016/j.cie.2020.106537 10.1016/j.amc.2005.12.027 10.1016/S0165-0114(97)00184-X 10.1007/s00500-001-0157-3 10.1016/j.ins.2012.04.037 |
| ContentType | Journal Article |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION DOA |
| DOI | 10.1109/ACCESS.2024.3467191 |
| DatabaseName | IEEE Xplore (IEEE) IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 145187 |
| ExternalDocumentID | oai_doaj_org_article_0c10688e729d46ceb1968af34ef33e94 10_1109_ACCESS_2024_3467191 10690267 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 12271132 funderid: 10.13039/501100001809 – fundername: Guangdong Provincial Basic and Applied Basic Research Fund grantid: 2024A1515010532 funderid: 10.13039/100017942 – fundername: Basic and Applied Basic Research Foundation of Guangdong Province; Guangdong Basic and Applied Basic Research Foundation grantid: 2022A1515011460; 2021ZDJS044 funderid: 10.13039/501100021171 |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION RIG |
| ID | FETCH-LOGICAL-c331t-53e23db0748aa1eb0c80a7b24105750342d72edfdc24953bf68f3c5ba7f5ea8f3 |
| IEDL.DBID | DOA |
| ISSN | 2169-3536 |
| IngestDate | Wed Aug 27 01:02:06 EDT 2025 Tue Jul 01 03:02:51 EDT 2025 Wed Aug 27 02:20:03 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c331t-53e23db0748aa1eb0c80a7b24105750342d72edfdc24953bf68f3c5ba7f5ea8f3 |
| ORCID | 0000-0003-2903-0249 0000-0001-7425-0748 |
| OpenAccessLink | https://doaj.org/article/0c10688e729d46ceb1968af34ef33e94 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_10690267 crossref_primary_10_1109_ACCESS_2024_3467191 doaj_primary_oai_doaj_org_article_0c10688e729d46ceb1968af34ef33e94 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20240000 2024-00-00 2024-01-01 |
| PublicationDateYYYYMMDD | 2024-01-01 |
| PublicationDate_xml | – year: 2024 text: 20240000 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref35 ref12 ref34 ref15 ref37 ref14 ref36 Pedrycz (ref8) 1982; 11 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref17 ref39 Sanchez (ref4) 1972 ref16 ref38 ref19 ref18 ref24 ref46 ref23 ref45 ref26 ref25 ref47 ref20 ref42 ref41 ref22 ref44 ref21 ref43 ref28 ref27 ref29 ref7 ref9 ref3 ref6 ref5 ref40 |
| References_xml | – ident: ref35 doi: 10.1007/s10700-021-09377-6 – ident: ref20 doi: 10.1016/0022-247X(91)90222-L – ident: ref42 doi: 10.1007/s10700-021-09371-y – ident: ref40 doi: 10.1007/s10700-019-09305-9 – ident: ref44 doi: 10.1007/s10700-019-09306-8 – ident: ref30 doi: 10.1016/j.ins.2015.07.015 – ident: ref3 doi: 10.1016/j.fss.2014.04.007 – ident: ref39 doi: 10.1109/TFUZZ.2016.2598367 – ident: ref38 doi: 10.1109/TFUZZ.2020.2991304 – ident: ref17 doi: 10.1007/s10700-011-9100-y – ident: ref27 doi: 10.1016/j.ins.2011.04.042 – ident: ref1 doi: 10.1016/S0019-9958(76)90446-0 – ident: ref9 doi: 10.1016/j.ins.2007.10.010 – ident: ref26 doi: 10.1016/j.ins.2011.09.030 – ident: ref45 doi: 10.1016/j.cie.2020.106644 – ident: ref34 doi: 10.1016/j.ins.2020.03.047 – ident: ref2 doi: 10.1109/FSKD.2012.6233956 – ident: ref33 doi: 10.1016/j.fss.2017.04.002 – ident: ref43 doi: 10.3233/IFS-151546 – ident: ref32 doi: 10.1109/TFUZZ.2015.2428716 – ident: ref19 doi: 10.1109/TFUZZ.2002.806322 – volume-title: Equations de relations floues year: 1972 ident: ref4 – ident: ref15 doi: 10.1016/j.fss.2009.01.012 – ident: ref11 doi: 10.1016/S0165-0114(86)80076-8 – ident: ref37 doi: 10.1007/s40815-018-0530-3 – ident: ref5 doi: 10.1016/0165-0114(84)90084-8 – ident: ref12 doi: 10.1016/j.ins.2011.04.011 – ident: ref25 doi: 10.1016/j.fss.2004.09.010 – ident: ref23 doi: 10.1007/s10700-008-9029-y – ident: ref10 doi: 10.1007/s10700-009-9059-0 – ident: ref22 doi: 10.1016/S0165-0114(98)00417-5 – ident: ref36 doi: 10.1109/TFUZZ.2016.2593496 – ident: ref47 doi: 10.1016/j.fss.2022.03.017 – ident: ref31 doi: 10.1016/j.cie.2014.03.024 – volume: 11 start-page: 24 year: 1982 ident: ref8 article-title: Fuzzy relational equations with triangular norms and their resolutions publication-title: Bull. Pour Les Sous-Ensembles Flous Et Leurs Appl. – ident: ref24 doi: 10.1109/TFUZZ.2002.800657 – ident: ref13 doi: 10.1016/j.ins.2011.03.004 – ident: ref14 doi: 10.1109/91.784204 – ident: ref16 doi: 10.1016/0165-0114(82)90043-4 – ident: ref7 doi: 10.1016/j.ins.2007.04.006 – ident: ref41 doi: 10.1016/j.fss.2022.02.005 – ident: ref6 doi: 10.1016/j.ins.2008.05.030 – ident: ref46 doi: 10.1016/j.cie.2020.106537 – ident: ref28 doi: 10.1016/j.amc.2005.12.027 – ident: ref21 doi: 10.1016/S0165-0114(97)00184-X – ident: ref18 doi: 10.1007/s00500-001-0157-3 – ident: ref29 doi: 10.1016/j.ins.2012.04.037 |
| SSID | ssj0000816957 |
| Score | 2.3068357 |
| Snippet | In order to describe the data transmission mechanism in the BitTorrent-like peer-to-peer file-sharing system, the addition-min fuzzy relation inequality system... |
| SourceID | doaj crossref ieee |
| SourceType | Open Website Index Database Publisher |
| StartPage | 145174 |
| SubjectTerms | addition-min composition fuzzy relation inequalities Fuzzy systems Generalized min-max programming problem Indexes Linear programming minimal solution Minimax techniques Optimization methods Peer-to-peer computing Programming Vectors |
| SummonAdditionalLinks | – databaseName: IEEE Electronic Library (IEL) dbid: RIE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS-wwFA7qShdenzjeq2Th0oxNkzTtcu7gIMKIC0V3JY9TLOKMSAfEX-9J0hEVBFcNaUpP-yU5j5wHISeZ0YWujGAoyiomGylYaUTGtOLalo0seHQen14VF7fy8l7d98HqMRYGAKLzGQxDM57l-7lbBFMZrnDU5fJCr5JV1NxSsNaHQSVUkKiU7jML8aw6G43H-BGoA-ZyKHBD4BX_wn1ikv4vVVUiU5n8IVdLcpIvyeNw0dmhe_uWqfHX9G6RzV68pKM0H7bJCsx2yManpIO7xEzaGMlCp-2sfcLBS8sY7ea0z0LdvoEP99nUvNLr5ML1FJ65TvVn6F3bPdCR99Hhi-FIGjaW3gFsj9xOzm_GF6wvtMCcELxjSkAuvEVpojSGg81ciRjaPLiAhnNOmXudg2-8C5WqhW2KshFOWaMbBQbb-2RtNp_BAaHgcw4oMpQWJRtkwHhx2lcKSouaqhIDcroEoH5O-TTqqIdkVZ3wqgNedY_XgPwPIH0MDcmwYwf-57pfW3XmeCidA6gneFk45D5VUZpGSGiEgEoOyF7A5tP7EiyHP_T_JeuBhmRo-UfWupcFHKHo0dnjOOXeAcWI1ao priority: 102 providerName: IEEE |
| Title | Finding Minimal Solution to Generalized Min-Max Programming Problem With Addition-Min Composition |
| URI | https://ieeexplore.ieee.org/document/10690267 https://doaj.org/article/0c10688e729d46ceb1968af34ef33e94 |
| Volume | 12 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQJxgQjyLKo_LAiGkcx6-xVFQVUlEHKrpFduyIDG0RChLi13N2AkonFqZEySVxvovu4Zy_Q-gmMVJIbRiBUJaTrMwYUYYlRHIqrSozQWPx-PxJzJbZ44qvOq2-Qk1YQw_cADdKChr6ongIAl0mCjAtWihTssyXjHkdmUDB53WSqWiDFRWay5ZmiCZ6NJ5M4I0gIUyzOwbWgWq644oiY_9Oi5XoYaZH6LANDfG4GdIx2vObE3TQIQw8RWZaxVUoeF5tqjUI_8xq4XqLWwbp6su7cJ7MzSdeNOVX63DNoukdg1-q-hWPnYvFWgQkcTAKbfFWHy2nD8-TGWmbJJCCMVoTznzKnIVIQBlDvU0KBfjbNJRvhn-UWepk6l3pitBlmtlSqJIV3BpZcm9g_wz1NtuNP0fYu5R6cPfKQlQCzhM2hXSae2Uhy-RsgG5_8MrfGi6MPOYQic4bePMAb97CO0D3AdNf0UBkHQ-AevNWvflf6h2gftBI53mQzqdCXvzHzS_RfhhwM6NyhXr1-4e_hhijtsP4OQ3jcsBvcwfMdA |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB5BOQAHnkUsTx844iWO7Tg5LitWC3RXPbSit8iPiYhQd1GVlar-esZ2tmqRkDjFchxlks_2PDwPgA-FNZVprOQkymquOiV5bWXBjRbG1Z2qRHIeX62r5an6dqbPxmD1FAuDiMn5DKexmc7yw9bvoqmMVjjpcmVl7sI9Yvxa5HCta5NKrCHRaDPmFhJF82k2n9NnkBZYqqmkLUE04hb_SWn6b9VVSWxl8RjWe4KyN8mv6W5wU3_1V67G_6b4CTwaBUw2yzPiKdzBzTN4eCPt4HOwiz7FsrBVv-nPafDeNsaGLRvzUPdXGOJ9vrKX7Dg7cZ3HZ45zBRr2ox9-slkIyeWL00gWt5bRBewQThdfTuZLPpZa4F5KMXAtsZTBkTxRWyvQFb4mFF0ZnUDjSacqgykxdMHHWtXSdVXdSa-dNZ1GS-0XcLDZbvAlMAylQBIaakeyDbFgungTGo21I11Vywl83APQ_s4ZNdqkiRRNm_FqI17tiNcEPkeQrofGdNipg_5zO66utvAiFs9B0hSCqjzxn6aqbScVdlJioyZwGLG58b4My6t_9L-H-8uT1VF79HX9_TU8iPRks8sbOBgudviWBJHBvUvT7w8So9jz |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finding+Minimal+Solution+to+Generalized+Min-Max+Programming+Problem+With+Addition-Min+Composition&rft.jtitle=IEEE+access&rft.au=Zhou%2C+Xuegang&rft.au=Qin%2C+Zejian&rft.date=2024&rft.issn=2169-3536&rft.eissn=2169-3536&rft.volume=12&rft.spage=145174&rft.epage=145187&rft_id=info:doi/10.1109%2FACCESS.2024.3467191&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_ACCESS_2024_3467191 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon |