Optimizing the linear fractional programming problem with max-archimedean t-norm fuzzy relational equation constraints

Yan Kuen Wu*, Sy Ming Guu, Julie Yu Chih Liu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2007 IEEE International Conference on Fuzzy Systems, FUZZY
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Conference on Fuzzy Systems, FUZZY - London, United Kingdom
Duration: 23 07 200726 07 2007

Publication series

NameIEEE International Conference on Fuzzy Systems
ISSN (Print)1098-7584

Conference

Conference2007 IEEE International Conference on Fuzzy Systems, FUZZY
Country/TerritoryUnited Kingdom
CityLondon
Period23/07/0726/07/07

Fingerprint

Dive into the research topics of 'Optimizing the linear fractional programming problem with max-archimedean t-norm fuzzy relational equation constraints'. Together they form a unique fingerprint.

Cite this