Solving linear optimization problems with max-star composition equation constraints
In this paper an optimization model with a linear objective function subject to a system of fuzzy relation composition equations is presented. Since the non-empty feasible solution set of the fuzzy relation equations is generally a non-convex set, the conventional linear programming method will not...
Uložené v:
| Vydané v: | Applied mathematics and computation Ročník 179; číslo 2; s. 654 - 661 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
Elsevier Inc
15.08.2006
Elsevier |
| Predmet: | |
| ISSN: | 0096-3003, 1873-5649 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | In this paper an optimization model with a linear objective function subject to a system of fuzzy relation composition equations is presented. Since the non-empty feasible solution set of the fuzzy relation equations is generally a non-convex set, the conventional linear programming method will not be suitable for solving such a problem. Therefore, an efficient solution procedure for such problems appears to be necessary. In this paper, firstly, we characterize the feasible solution set, and then introduce two efficient procedures for solving the problem. Finally, two concrete examples are included for more details. |
|---|---|
| ISSN: | 0096-3003 1873-5649 |
| DOI: | 10.1016/j.amc.2005.12.006 |