Max-min fuzzy bi-level programming: resource sharing system with application
This study delves into the application of min-max fuzzy relation systems, specifically focusing on equality and inequality, in the examination of educational institution networks and their resource-sharing dynamics, akin to a P2P network structure. Expanding upon this framework, this article intrica...
Saved in:
Published in | Applied mathematics in science and engineering Vol. 32; no. 1 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Abingdon
Taylor & Francis Ltd
31.12.2024
Taylor & Francis Group |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | This study delves into the application of min-max fuzzy relation systems, specifically focusing on equality and inequality, in the examination of educational institution networks and their resource-sharing dynamics, akin to a P2P network structure. Expanding upon this framework, this article intricately explores a mathematical system featuring three or more terminals within an education resource system, each comprising distinct sharing capabilities. The terminals exchange information on various educational facets, encompassing variations and expenditures per share data, within the framework of a programming-type fuzzy objective function, constrained by the parameters of an educational information system. In these scenarios, the transfer of resources from one terminal to another is interlinked, introducing complexities that warrant a comprehensive examination. Notably, the consideration of greater downloading resources in specific cases is proposed for enhanced practicality. The primary objective of this article is to minimize network congestion within different educational networks, given fixed priority grades assigned to the terminals. To achieve this, the concept of a Lexicographic minimum solution is introduced to address max-min fuzzy relation inequalities, aligning with the defined objectives. The article presents a detailed and effective scenario for implementing the Lexicographic minimal solution. For validation purposes, the proposed scenario is supported by illustrative examples, offering tangible insights into its applicability and efficacy. |
---|---|
AbstractList | This study delves into the application of min-max fuzzy relation systems, specifically focusing on equality and inequality, in the examination of educational institution networks and their resource-sharing dynamics, akin to a P2P network structure. Expanding upon this framework, this article intricately explores a mathematical system featuring three or more terminals within an education resource system, each comprising distinct sharing capabilities. The terminals exchange information on various educational facets, encompassing variations and expenditures per share data, within the framework of a programming-type fuzzy objective function, constrained by the parameters of an educational information system. In these scenarios, the transfer of resources from one terminal to another is interlinked, introducing complexities that warrant a comprehensive examination. Notably, the consideration of greater downloading resources in specific cases is proposed for enhanced practicality. The primary objective of this article is to minimize network congestion within different educational networks, given fixed priority grades assigned to the terminals. To achieve this, the concept of a Lexicographic minimum solution is introduced to address max-min fuzzy relation inequalities, aligning with the defined objectives. The article presents a detailed and effective scenario for implementing the Lexicographic minimal solution. For validation purposes, the proposed scenario is supported by illustrative examples, offering tangible insights into its applicability and efficacy. |
Author | Zhang, Lei |
Author_xml | – sequence: 1 givenname: Lei surname: Zhang fullname: Zhang, Lei organization: School of Mathematics and Statistics, Hanshan Normal University, Chaozhou, People's Republic of China |
BookMark | eNqFUU1P3DAQtSqQSoGfgBSp5ywztmPH5VQhWpC24gJna-LYi1fZZLGzLcuvb5aFCnHpaUZv5r35eF_YQT_0nrEzhBlCDedcKwMGccaByxkXohJoPrGjHV7uCgfv8s_sNOclAHBtJBh9xOa_6Klcxb4Im-fnbdHEsvO_fVes07BItJoqi29F8nnYJOeL_EBpQoq8zaNfFX_i-FDQet1FR2Mc-hN2GKjL_vQ1HrP7H1d3l9fl_PbnzeX3eemEkWPZAmhpUJFWyrfeB9OgcFppR0KTablziHXtSIISqsbKizaoUDWK80Z5EsfsZq_bDrS06xRXlLZ2oGhfgCEtLKUxus5bbeqmCRI8cidrNHVoURsBVFcQyMtJ6-tea7r4cePzaJfTrf20vhUoUaMGDlNXte9yacg5-fBvKoLd-WDffLA7H-yrDxPv4gPPxfHlV2Oi2P2H_Rc5S44Y |
CitedBy_id | crossref_primary_10_1109_TFUZZ_2024_3514746 crossref_primary_10_7717_peerj_cs_2701 |
Cites_doi | 10.1016/j.dam.2006.08.011 10.1023/A:1022848114005 10.1016/j.mcm.2010.01.006 10.1016/j.cam.2023.115089 10.1007/s10700-008-9029-y 10.1109/FSKD.2012.6233956 10.1109/Access.6287639 10.1080/16168658.2020.1761511 10.1016/j.fss.2017.08.001 10.1109/ACCESS.2017.2731819 10.1504/IJBIC.2023.130549 10.1016/j.ins.2011.09.030 10.1007/978-94-017-1650-5 10.1016/j.fss.2019.02.016 10.1016/j.cie.2011.09.012 10.1007/s13042-016-0527-x 10.1016/j.ins.2005.11.008 10.1016/j.chaos.2023.113440 10.1016/j.ins.2015.07.015 10.1016/B978-1-4832-1450-4.50017-1 10.1109/ACCESS.2018.2877199 10.1109/TFUZZ.2017.2771406 10.31181/sa310823p 10.1016/S0019-9958(76)90446-0 10.1016/j.cie.2014.03.024 10.1016/j.laa.2019.12.017 10.1109/91.855920 10.1109/ACCESS.2018.2841989 10.1007/s10700-019-09306-8 10.1016/j.chaos.2006.07.051 10.1016/j.fss.2014.10.008 10.1007/s40815-018-0530-3 10.1109/TFUZZ.2015.2428716 10.1109/TFUZZ.91 10.1016/j.najef.2022.101672 10.1016/0022-247X(91)90222-L 10.1016/j.ins.2016.04.014 10.1007/s10700-019-09305-9 |
ContentType | Journal Article |
Copyright | 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group. This work is licensed under the Creative Commons Attribution – Non-Commercial License http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
Copyright_xml | – notice: 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group. This work is licensed under the Creative Commons Attribution – Non-Commercial License http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 KR7 L7M L~C L~D DOA |
DOI | 10.1080/27690911.2024.2335319 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals |
DatabaseTitle | CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Civil Engineering Abstracts |
Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Applied Sciences Education |
EISSN | 2769-0911 |
ExternalDocumentID | oai_doaj_org_article_798bbf40e12c48198fd17930a850fae4 10_1080_27690911_2024_2335319 |
GroupedDBID | 0YH AAYXX ABDBF ALMA_UNASSIGNED_HOLDINGS AMVHM CITATION EAP EBS EMK EPL EST ESX GROUPED_DOAJ H13 I-F M4Z MK~ M~E TDBHL TFL TUS 7SC 7TB 8FD ACUHS FR3 JQ2 KR7 L7M L~C L~D |
ID | FETCH-LOGICAL-c394t-d0074916a766edeef9b13c767ca37a9d2cc1188ca40636815e3df6f5b622b6ea3 |
IEDL.DBID | DOA |
ISSN | 2769-0911 |
IngestDate | Wed Aug 27 01:29:12 EDT 2025 Fri Jul 25 19:12:06 EDT 2025 Tue Jul 01 01:11:30 EDT 2025 Thu Apr 24 23:13:03 EDT 2025 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c394t-d0074916a766edeef9b13c767ca37a9d2cc1188ca40636815e3df6f5b622b6ea3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
OpenAccessLink | https://doaj.org/article/798bbf40e12c48198fd17930a850fae4 |
PQID | 3141717020 |
PQPubID | 53234 |
ParticipantIDs | doaj_primary_oai_doaj_org_article_798bbf40e12c48198fd17930a850fae4 proquest_journals_3141717020 crossref_primary_10_1080_27690911_2024_2335319 crossref_citationtrail_10_1080_27690911_2024_2335319 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2024-12-31 |
PublicationDateYYYYMMDD | 2024-12-31 |
PublicationDate_xml | – month: 12 year: 2024 text: 2024-12-31 day: 31 |
PublicationDecade | 2020 |
PublicationPlace | Abingdon |
PublicationPlace_xml | – name: Abingdon |
PublicationTitle | Applied mathematics in science and engineering |
PublicationYear | 2024 |
Publisher | Taylor & Francis Ltd Taylor & Francis Group |
Publisher_xml | – name: Taylor & Francis Ltd – name: Taylor & Francis Group |
References | e_1_3_3_52_1 e_1_3_3_50_1 El-Morsy SA. (e_1_3_3_17_1) 2022; 1 Klir G (e_1_3_3_22_1) 1995 Gurmu ED (e_1_3_3_14_1) 2020; 1 e_1_3_3_18_1 e_1_3_3_39_1 e_1_3_3_37_1 e_1_3_3_35_1 e_1_3_3_10_1 e_1_3_3_33_1 e_1_3_3_12_1 e_1_3_3_31_1 e_1_3_3_40_1 Yang X-P. (e_1_3_3_45_1) 2019; 2019 Kumar Das S (e_1_3_3_16_1) 2021; 46 Das SK. (e_1_3_3_20_1) 2021; 1 e_1_3_3_7_1 e_1_3_3_9_1 e_1_3_3_29_1 e_1_3_3_25_1 e_1_3_3_48_1 e_1_3_3_27_1 e_1_3_3_46_1 e_1_3_3_3_1 e_1_3_3_21_1 e_1_3_3_44_1 e_1_3_3_5_1 e_1_3_3_23_1 e_1_3_3_42_1 e_1_3_3_30_1 e_1_3_3_51_1 Ghahremani-Nahr J (e_1_3_3_15_1) 2023; 10 e_1_3_3_13_1 e_1_3_3_38_1 e_1_3_3_36_1 e_1_3_3_34_1 e_1_3_3_11_1 e_1_3_3_32_1 e_1_3_3_41_1 Nasab PT (e_1_3_3_19_1) 2023; 12 e_1_3_3_6_1 e_1_3_3_8_1 e_1_3_3_28_1 e_1_3_3_24_1 e_1_3_3_49_1 e_1_3_3_26_1 e_1_3_3_47_1 e_1_3_3_2_1 e_1_3_3_4_1 e_1_3_3_43_1 |
References_xml | – ident: e_1_3_3_5_1 doi: 10.1016/j.dam.2006.08.011 – ident: e_1_3_3_26_1 doi: 10.1023/A:1022848114005 – ident: e_1_3_3_35_1 doi: 10.1016/j.mcm.2010.01.006 – volume: 2019 year: 2019 ident: e_1_3_3_45_1 article-title: Evaluation model and approximate solution to inconsistent max-min fuzzy relation inequalities in P2P file sharing system publication-title: Complexity – ident: e_1_3_3_41_1 doi: 10.1016/j.cam.2023.115089 – ident: e_1_3_3_6_1 doi: 10.1007/s10700-008-9029-y – volume: 12 start-page: 2783 issue: 1 year: 2023 ident: e_1_3_3_19_1 article-title: A mathematical model for robust landing and take-off scheduling at an airport considering runway disturbances publication-title: Int J Res Ind Eng – ident: e_1_3_3_28_1 doi: 10.1109/FSKD.2012.6233956 – ident: e_1_3_3_44_1 doi: 10.1109/Access.6287639 – ident: e_1_3_3_21_1 doi: 10.1080/16168658.2020.1761511 – ident: e_1_3_3_10_1 doi: 10.1109/Access.6287639 – ident: e_1_3_3_50_1 doi: 10.1016/j.fss.2017.08.001 – ident: e_1_3_3_7_1 doi: 10.1109/ACCESS.2017.2731819 – volume-title: Fuzzy sets and fuzzy logic year: 1995 ident: e_1_3_3_22_1 – ident: e_1_3_3_42_1 doi: 10.1504/IJBIC.2023.130549 – volume: 1 start-page: 252 issue: 4 year: 2020 ident: e_1_3_3_14_1 article-title: Fuzzy programming approach to bi-level linear programming problems publication-title: J Fuzzy Ext Appl – volume: 10 start-page: 518 issue: 4 year: 2023 ident: e_1_3_3_15_1 article-title: Bi-objective fuzzy food bank network design with considering freshness of food baskets publication-title: J Appl Res Ind Eng – ident: e_1_3_3_48_1 doi: 10.1016/j.ins.2011.09.030 – ident: e_1_3_3_25_1 doi: 10.1007/978-94-017-1650-5 – ident: e_1_3_3_49_1 – ident: e_1_3_3_4_1 doi: 10.1016/j.fss.2019.02.016 – ident: e_1_3_3_36_1 doi: 10.1016/j.cie.2011.09.012 – ident: e_1_3_3_51_1 doi: 10.1007/s13042-016-0527-x – volume: 46 start-page: 12 issue: 1 year: 2021 ident: e_1_3_3_16_1 article-title: A novel lexicographical-based method for trapezoidal neutrosophic linear programming problem publication-title: Neutrosophic Sets Syst – ident: e_1_3_3_23_1 doi: 10.1016/j.ins.2005.11.008 – ident: e_1_3_3_40_1 doi: 10.1016/j.chaos.2023.113440 – ident: e_1_3_3_27_1 doi: 10.1016/j.ins.2015.07.015 – volume: 1 start-page: 147 issue: 4 year: 2022 ident: e_1_3_3_17_1 article-title: Optimization of fuzzy zero-base budgeting publication-title: Comput Algorithms Numer Dimens – ident: e_1_3_3_13_1 doi: 10.1016/B978-1-4832-1450-4.50017-1 – ident: e_1_3_3_9_1 doi: 10.1109/ACCESS.2018.2877199 – ident: e_1_3_3_32_1 doi: 10.1109/TFUZZ.2017.2771406 – volume: 1 start-page: 30 issue: 1 year: 2021 ident: e_1_3_3_20_1 article-title: Optimization of fuzzy linear fractional programming problem with fuzzy numbers publication-title: Big Data Comput Visions – ident: e_1_3_3_18_1 doi: 10.31181/sa310823p – ident: e_1_3_3_12_1 doi: 10.1016/S0019-9958(76)90446-0 – ident: e_1_3_3_39_1 doi: 10.1016/j.fss.2017.08.001 – ident: e_1_3_3_37_1 doi: 10.1016/j.cie.2014.03.024 – ident: e_1_3_3_2_1 doi: 10.1016/j.laa.2019.12.017 – ident: e_1_3_3_24_1 doi: 10.1109/91.855920 – ident: e_1_3_3_52_1 doi: 10.1109/Access.6287639 – ident: e_1_3_3_8_1 doi: 10.1109/ACCESS.2018.2841989 – ident: e_1_3_3_11_1 doi: 10.1109/Access.6287639 – ident: e_1_3_3_33_1 doi: 10.1007/s10700-019-09306-8 – ident: e_1_3_3_46_1 doi: 10.1016/j.chaos.2006.07.051 – ident: e_1_3_3_3_1 doi: 10.1016/j.fss.2014.10.008 – ident: e_1_3_3_34_1 doi: 10.1007/s40815-018-0530-3 – ident: e_1_3_3_29_1 doi: 10.1109/TFUZZ.2015.2428716 – ident: e_1_3_3_30_1 doi: 10.1109/TFUZZ.91 – ident: e_1_3_3_43_1 doi: 10.1016/j.najef.2022.101672 – ident: e_1_3_3_47_1 doi: 10.1016/0022-247X(91)90222-L – ident: e_1_3_3_38_1 doi: 10.1016/j.ins.2016.04.014 – ident: e_1_3_3_31_1 doi: 10.1007/s10700-019-09305-9 |
SSID | ssj0002794097 |
Score | 2.3116198 |
Snippet | This study delves into the application of min-max fuzzy relation systems, specifically focusing on equality and inequality, in the examination of educational... |
SourceID | doaj proquest crossref |
SourceType | Open Website Aggregation Database Enrichment Source Index Database |
SubjectTerms | 08A72 15B15 Education Effectiveness Expenditures Fuzzy systems Mathematical system max-min fuzzy relation inequality system numerical example programming for fuzzy solution |
Title | Max-min fuzzy bi-level programming: resource sharing system with application |
URI | https://www.proquest.com/docview/3141717020 https://doaj.org/article/798bbf40e12c48198fd17930a850fae4 |
Volume | 32 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQEwtvRHnJA6vb-BmHDRBVhSgTlbpFZ8fmoVJQWyRg4LdjJ25VxMDCkiGJFet8l_vufP4OoVMvqAZjDWFaaiKACgKgIt2dDeDcM3B5PDvcv1W9gbgeyuFSq69YE9bQAzeC6-SFNsaLzFFmRXBf2ldRpzLQMvPgaibQ4POWgqmnejutiERO8yM7OuuwPMSBwbJDSMhEm3Eele-HM6o5-3_9kms_091E6wkg4vNmYltoxY230UYCiziZ4nQH3fThnTw_jrF_-_z8wOaRjGL9D04FV-HJ_RmepOQ8nj5ATODhhrgZx-wrXtq73kWD7tXdZY-k1gjE8kLMSBVdf0B2kCvlKud8YYJ0c5Vb4DkUFbM2RA7aQvDXXGkqHa-88tIoxoxywPfQ6vhl7PYRrqxU1nEhC0eFBGskUJsV1nqltATdQmIuo9Im3vDYvmJU0kQvOhdtGUVbJtG2UHsx7LUhzvhrwEVcgMXLkfe6vhG0oUzaUP6lDS10NF--MhnjtORU0BC1BmB88B_fOERrcd4N2-MRWp1N3txxQCYzc1IrYbj2v66-ASRu3bM |
linkProvider | Directory of Open Access Journals |
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=Max-min+fuzzy+bi-level+programming%3A+resource+sharing+system+with+application&rft.jtitle=Applied+mathematics+in+science+and+engineering&rft.au=Lei+Zhang&rft.date=2024-12-31&rft.pub=Taylor+%26+Francis+Group&rft.eissn=2769-0911&rft.volume=32&rft.issue=1&rft_id=info:doi/10.1080%2F27690911.2024.2335319&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_798bbf40e12c48198fd17930a850fae4 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2769-0911&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2769-0911&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2769-0911&client=summon |