Optimizing the Linear Fractional Programming Problem with Max-Archimedean t-norm Fuzzy Relational Equation Constraints

In the literature, one of the minimal solutions is an optimal solution of solving a linear objective function subject to fuzzy relational equations with the max-Archimedean composition. Since the objective function is nonlinear so that this characteristic can't be employed again to the optimiza...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2007 IEEE International Fuzzy Systems Conference s. 1 - 6
Hlavní autoři: Yan-Kuen Wu, Sy-Ming Guu, Liu, J.Y.-C.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2007
Témata:
Constraint optimization
Differential equations
Functional programming
Fuzzy sets
Information management
Linear programming
Mathematical model
Nonlinear equations
NP-hard problem
Optimization methods
ISBN:1424412099, 9781424412099
ISSN:1098-7584
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!
Popis
Shrnutí:In the literature, one of the minimal solutions is an optimal solution of solving a linear objective function subject to fuzzy relational equations with the max-Archimedean composition. Since the objective function is nonlinear so that this characteristic can't be employed again to the optimization problem with a linear fractional objective function. In this paper, according to the characteristics of feasible domain of fuzzy relational equations with max-Archimedean t-norm composition, some theoretical results are presented for exploring such an optimization problem. These results can be employed to cut down the feasible domain first. Hence, the work of computing an optimal solution can be simplified. Then the simplified problem can be converted into traditional linear fractional programming problems and a simple procedure is proposed for optimizing such a problem.
ISBN:1424412099
9781424412099
ISSN:1098-7584
DOI:10.1109/FUZZY.2007.4295386