A new matrix-based-algorithm for solving latticized linear programming subject to max-min-product fuzzy relation inequalities
This paper introduces a system of Fuzzy Relation Inequalities (FRIs) with the max-min-product composition operator. To determine the structure of solution set of the system, we firstly focus on a single inequality and study its solution set and properties. Then, the structure of solution set of the...
Uloženo v:
| Vydáno v: | Iranian journal of fuzzy systems (Online) Ročník 21; číslo 5; s. 89 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Zahedan
University of Sistan and Baluchestan, Iranian Journal of Fuzzy Systems
01.09.2024
|
| Témata: | |
| ISSN: | 1735-0654, 2676-4334 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This paper introduces a system of Fuzzy Relation Inequalities (FRIs) with the max-min-product composition operator. To determine the structure of solution set of the system, we firstly focus on a single inequality and study its solution set and properties. Then, the structure of solution set of the system is determined by the points. The necessary and sufficient conditions are proposed for its consistency. Some useful properties of the system of the max-min-product FRIs are presented to determine the structure of its minimal solutions. A latticized linear programming problem is proposed with constraints as FRIs using the max-min-product composition. It is shown that one of its optimal solutions can be given in terms of a closed form. Based on the closed form, a matrix-based-algorithm with a polynomial computational complexity is designed to find one of its optimal solutions. A practical example is presented to illustrate the system and the optimization problem in the area of data transmission mechanism. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1735-0654 2676-4334 |
| DOI: | 10.22111/ijfs.2024.49647.8759 |