Linear fractional programming problem with max-Hamacher FRI
In this paper, the linear fractional programming problem subject to a system of fuzzy relation inequalities (FRI) with the max-Hamacher composition operator is studied. First, the structure of its feasible domain is investigated, and its feasible solution set determined. Then, some sufficient condit...
Saved in:
| Published in: | Iranian journal of science (Online) Vol. 42; no. 2; pp. 693 - 705 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Shiraz
Springer Nature B.V
01.06.2018
|
| Subjects: | |
| ISSN: | 2731-8095, 2731-8109 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, the linear fractional programming problem subject to a system of fuzzy relation inequalities (FRI) with the max-Hamacher composition operator is studied. First, the structure of its feasible domain is investigated, and its feasible solution set determined. Then, some sufficient conditions are given that under them, some of the optimal components of the problem are directly determined. The optimal solution of the linear fractional programming problem might not be any of the minimal solutions. However, in the process of obtaining the optimal solution, we need to compute the minimal solutions. Therefore, some reductions are presented that under them, we can compute the minimal solutions fast. The original problem can be transformed into some traditional linear fractional programming subproblems and eventually optimized in a small search space. Finally, an algorithm is designed to solve the problem based on the above reductions. An application and some numerical examples are provided to illustrate the procedure. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2731-8095 2731-8109 |
| DOI: | 10.1007/s40995-016-0108-6 |