Generalized min-max programming problems subject to addition-min fuzzy relational inequalities

Yan Kuen Wu, Ya Ling Chiu, Sy Ming Guu*

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

9 Scopus citations

Abstract

In this paper, we explore a new generalized min-max programming problem with constraints of addition-min fuzzy relational inequalities. This new generalized min-max programming model provides unified settings that enable the system manager to understand the system congestion level or the worst individual cost in the BitTorrent-like peer-to-peer file-sharing system. Theoretical results are presented to illustrate how the optimal value of generalized min-max programming problem can be obtained by solving a single-variable optimization model. Two approaches (an analytic method and an iterative approach) are provided to solve this single-variable optimization model. The complexity analyses of these two approaches are provided. Numerical examples demonstrate our proposed approaches.

Original languageEnglish
Pages (from-to)22-38
Number of pages17
JournalFuzzy Sets and Systems
Volume447
DOIs
StatePublished - 15 10 2022

Bibliographical note

Publisher Copyright:
© 2022 Elsevier B.V.

Keywords

  • A single-variable optimization model
  • Addition-min fuzzy relational inequalities
  • Generalized min-max programming problem
  • The iterative approach

Fingerprint

Dive into the research topics of 'Generalized min-max programming problems subject to addition-min fuzzy relational inequalities'. Together they form a unique fingerprint.

Cite this