IDEAS home Printed from https://ideas.repec.org/a/spr/fuzodm/v21y2022i3d10.1007_s10700-021-09371-y.html
   My bibliography  Save this article

Some results for the minimal optimal solution of min-max programming problem with addition-min fuzzy relational inequalities

Author

Listed:
  • Yan-Kuen Wu

    (Zhejiang Yuexiu University of Foreign Languages)

  • Ching-Feng Wen

    (Kaohsiung Medical University
    Kaohsiung Medical University Hospital)

  • Yuan-Teng Hsu

    (Shanghai Business School)

  • Ming-Xian Wang

    (Zhejiang Yuexiu University of Foreign Languages)

Abstract

In this study, a BitTorrent-like peer-to-peer (BT-P2P) file-sharing system is reduced into a system of fuzzy relational inequalities (FRI) with addition-min composition. To study the stability of data transmission and network congestion, a min-max programming problem subject to addition-min FRI is proposed. From a cost-saving perspective, the optimal solution to the min-max programming problem may not be the minimal optimal solution. Furthermore, while the “optimal” solution provides better cost performance, the “minimal” solution provides for the least congestion of the file-sharing system. In this paper, we propose adopting a binding variable approach based on certain new theoretical properties to find a minimal optimal solution for the min-max programming problem. It is for these new properties that the minimal optimal solution obtained via the binding variable approach would minimize the maximum transmission level; further, the amounts of data download in the optimal solution would be as balanced as possible. Some numerical examples are provided after each of the new properties to illustrate the advantages of our approach.

Suggested Citation

  • Yan-Kuen Wu & Ching-Feng Wen & Yuan-Teng Hsu & Ming-Xian Wang, 2022. "Some results for the minimal optimal solution of min-max programming problem with addition-min fuzzy relational inequalities," Fuzzy Optimization and Decision Making, Springer, vol. 21(3), pages 429-454, September.
    • Handle: RePEc:spr:fuzodm:v:21:y:2022:i:3:d:10.1007_s10700-021-09371-y
    DOI: 10.1007/s10700-021-09371-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10700-021-09371-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10700-021-09371-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ya-Ling Chiu & Sy-Ming Guu & Jiajun Yu & Yan-Kuen Wu, 2019. "A single-variable method for solving min–max programming problem with addition-min fuzzy relational inequalities," Fuzzy Optimization and Decision Making, Springer, vol. 18(4), pages 433-449, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yan-Kuen Wu & Ching-Feng Wen & Yuan-Teng Hsu & Ming-Xian Wang, 2022. "Finding minimal solutions to the system of addition-min fuzzy relational inequalities," Fuzzy Optimization and Decision Making, Springer, vol. 21(4), pages 581-603, December.
    2. Gang Xiao & Khizar Hayat & Xiaopeng Yang, 2023. "Evaluation and its derived classification in a Server-to-Client architecture based on the fuzzy relation inequality," Fuzzy Optimization and Decision Making, Springer, vol. 22(2), pages 213-245, June.
    3. Jianjun Qiu & Xiaopeng Yang, 2022. "Min–max programming problem with constraints of addition-min-product fuzzy relation inequalities," Fuzzy Optimization and Decision Making, Springer, vol. 21(2), pages 291-317, June.
    4. Yan-Kuen Wu & Sy-Ming Guu & Ya-Chan Chang, 2024. "A Single-Variable Method for Solving the Min–Max Programming Problem with Addition–Overlap Function Composition," Mathematics, MDPI, vol. 12(20), pages 1-16, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:fuzodm:v:21:y:2022:i:3:d:10.1007_s10700-021-09371-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.