By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan-Kuen Wu ; Department of Industrial Management, Vanung University, Taoyuan, 320, Taiwan, R.O.C. email: ykw@vnu.edu.tw ; Sy-Ming Guu ; Julie Yu-Chih Liu

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.

Published in:

2007 IEEE International Fuzzy Systems Conference

Date of Conference:

23-26 July 2007