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

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 indiv...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Fuzzy sets and systems Ročník 447; s. 22 - 38
Hlavní autori: Wu, Yan-Kuen, Chiu, Ya-Ling, Guu, Sy-Ming
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 15.10.2022
Predmet:
ISSN:0165-0114
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:0165-0114
DOI:10.1016/j.fss.2022.03.017