An Iterative Algorithm for Min-max Programming Problem with Addition-min Fuzzy Relational Inequalities in P2P File Sharing Systems
In this paper, we formulate the P2P file sharing system into addition-min fuzzy relation inequalities. The objective of the problem is to minimize the network congestion of the P2P file sharing system. To reduce this factor, we have considered the min-max optimization problem subject to addition-min...
Uložené v:
| Vydané v: | Asian Research Journal of Mathematics Ročník 21; číslo 5; s. 225 - 241 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
SCIENCEDOMAIN international
22.05.2025
|
| Predmet: | |
| ISSN: | 2456-477X, 2456-477X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, we formulate the P2P file sharing system into addition-min fuzzy relation inequalities. The objective of the problem is to minimize the network congestion of the P2P file sharing system. To reduce this factor, we have considered the min-max optimization problem subject to addition-min fuzzy relation inequalities. To solve this problem, we first discuss some properties of addition-min fuzzy relation inequalities. Using these properties, notion of binding variables is introduced and an iterative algorithm is proposed based on greedy approach. The algorithm is designed in such a way that the maximum value corresponding to the component of the solution vector remains as small as possible. The proposed greedy algorithm provides the approximate optimal solution for the problem. The sufficiency condition for the optimality of the solution is also derived. The proposed algorithm is illustrated using some examples. |
|---|---|
| AbstractList | In this paper, we formulate the P2P file sharing system into addition-min fuzzy relation inequalities. The objective of the problem is to minimize the network congestion of the P2P file sharing system. To reduce this factor, we have considered the min-max optimization problem subject to addition-min fuzzy relation inequalities. To solve this problem, we first discuss some properties of addition-min fuzzy relation inequalities. Using these properties, notion of binding variables is introduced and an iterative algorithm is proposed based on greedy approach. The algorithm is designed in such a way that the maximum value corresponding to the component of the solution vector remains as small as possible. The proposed greedy algorithm provides the approximate optimal solution for the problem. The sufficiency condition for the optimality of the solution is also derived. The proposed algorithm is illustrated using some examples. |
| Author | Thapar, Antika Katara, Mohit Bansal, Richa |
| Author_xml | – sequence: 1 givenname: Mohit surname: Katara fullname: Katara, Mohit – sequence: 2 givenname: Antika surname: Thapar fullname: Thapar, Antika – sequence: 3 givenname: Richa surname: Bansal fullname: Bansal, Richa |
| BackLink | https://hal.science/hal-05081209$$DView record in HAL |
| BookMark | eNpNkD1PwzAURS1UJErpL2DxyhDqzzgZo4pCpSIqChKb5SQvrVGcgJMWysgvJ6GAmN7V1Xl3OKdoUNUVIHROyWWsuJgY_1y7CSNMTnaMWhnz8AgNmZBhIJR6GvzLJ2jcNDYlQihOQqmG6DOp8LwFb1q7A5yU69rbduNwUXt8a6vAmXe89PXaG-dste5zWoLDbx2Fkzy3ra07ylZ4tv342ON7KE1fmRLPK3jdmrIjoMEdsGRLPLMl4NXG-H5rtW9acM0ZOi5M2cD4547Q4-zqYXoTLO6u59NkEWSU8TDICplKZgynIIAoxUCGBU-FyvIcRGRUClEEnOUQZUwpKWicRVRCnBeqUBDxEbo47G5MqV-8dcbvdW2svkkWuu-IJBFlJN7RjuUHNvN103go_h4o0b11_W1d99b1r3X-BcMreyM |
| ContentType | Journal Article |
| Copyright | licence_http://creativecommons.org/publicdomain/zero |
| Copyright_xml | – notice: licence_http://creativecommons.org/publicdomain/zero |
| DBID | AAYXX CITATION 1XC |
| DOI | 10.9734/arjom/2025/v21i5936 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 2456-477X |
| EndPage | 241 |
| ExternalDocumentID | oai:HAL:hal-05081209v1 10_9734_arjom_2025_v21i5936 |
| GroupedDBID | AAYXX CITATION M~E 1XC |
| ID | FETCH-LOGICAL-c1236-cf5b52aa31e4e0772e56f3b47cdde48a7be88e32de8c2775419c815e9df7f7e83 |
| ISSN | 2456-477X |
| IngestDate | Tue Nov 18 06:20:39 EST 2025 Sat Nov 29 07:54:45 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1236-cf5b52aa31e4e0772e56f3b47cdde48a7be88e32de8c2775419c815e9df7f7e83 |
| OpenAccessLink | https://doi.org/10.9734/arjom/2025/v21i5936 |
| PageCount | 17 |
| ParticipantIDs | hal_primary_oai_HAL_hal_05081209v1 crossref_primary_10_9734_arjom_2025_v21i5936 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-05-22 |
| PublicationDateYYYYMMDD | 2025-05-22 |
| PublicationDate_xml | – month: 05 year: 2025 text: 2025-05-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | Asian Research Journal of Mathematics |
| PublicationYear | 2025 |
| Publisher | SCIENCEDOMAIN international |
| Publisher_xml | – name: SCIENCEDOMAIN international |
| SSID | ssib044730657 |
| Score | 2.2921035 |
| Snippet | In this paper, we formulate the P2P file sharing system into addition-min fuzzy relation inequalities. The objective of the problem is to minimize the network... |
| SourceID | hal crossref |
| SourceType | Open Access Repository Index Database |
| StartPage | 225 |
| SubjectTerms | Mathematics |
| Title | An Iterative Algorithm for Min-max Programming Problem with Addition-min Fuzzy Relational Inequalities in P2P File Sharing Systems |
| URI | https://hal.science/hal-05081209 |
| Volume | 21 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2456-477X dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044730657 issn: 2456-477X databaseCode: M~E dateStart: 20160101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLbK4AAHxE-xDZCFuJVoaRLHyTFiqzqxlkgUqbfISRwSaNOpdFXZgQP_Jv8M7zlO4nEaBy5R5FhV4vfVz37-3vcIeRsWdgGewLPAOWaWNxLcCn3uWqkULHNl5rLcVsUm-GwWLBZhPBj8bnNhdkte18F-H17-V1NDGxgbU2f_wdzdj0ID3IPR4Qpmh-utDI9hPiWVjJygaPllDdv_cqXohNOqtlZij9kBSMpaYZggbirKNAHZKM8VhcuCR8Px1fX1j44tpzQ5ZJODWSkW1zB24uG4QjJiKRSNz5Q_b5VtVZJmy-8bGuvfaScY258nia1QdY9gqimrjpAzL8Gjb7TUQfWtDyFgqfNlJw9gBjAchmfvTr_d1cG004_T6HymRDK6OGg_F-LxrOVxvjAn7ia1WgOUmbNwk0utHbrTKGv97StC7nroCDdf1ytMi7FVHaidM6qwyGHvHltKwCT6lMSn4-TifPbh5lOD0jiJLuBaiiV8JCy2HDvcwdb8rsNZiHzD6c-zdrLzPJhbfaVE231co4qFL3aiXgsjU-ykfaUbK6c7ZRv4Vwuh-SPyUFuQRg3yHpOBrJ-QB4Y1n5JfUU07DNIOgxQwSDUGqYFBqjFIEYPUxCBVGKQ9BqmJQQodAIMUMUg1BqnG4DPyeXw2fz-xdLEPK0MBICsrWMocIdyR9KQNez7J_MJNPZ6BA_YCwVMZBNJ1chlkDso2jsIsGDEZ5gUvuAzc5-SgXtfyBaF4ks5y3Ol4ErWnUg5uOfD9VAhY_hf5IXnXDmRy2Wi6JLAXxnFP1LgnOO5JO-6H5A0MdtcT9djBzAm29UY-uk2nY3K__wO8JAfbzZV8Re5lu231ffNaweMPC7yo5w |
| linkProvider | ISSN International Centre |
| 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=An+Iterative+Algorithm+for+Min-max+Programming+Problem+with+Addition-min+Fuzzy+Relational+Inequalities+in+P2P+File+Sharing+Systems&rft.jtitle=Asian+Research+Journal+of+Mathematics&rft.au=Katara%2C+Mohit&rft.au=Thapar%2C+Antika&rft.au=Bansal%2C+Richa&rft.date=2025-05-22&rft.pub=SCIENCEDOMAIN+international&rft.issn=2456-477X&rft.volume=21&rft.issue=5&rft.spage=225&rft.epage=241&rft_id=info:doi/10.9734%2Farjom%2F2025%2Fv21i5936&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-05081209v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2456-477X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2456-477X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2456-477X&client=summon |