On Archimedean triangular norms
Fuzzy Sets and Systems
Solving fuzzy relation equations with a linear objective function
Fuzzy Sets and Systems
Solving nonlinear optimization problems with fuzzy relation equation constraints
Fuzzy Sets and Systems
Resolution of composite fuzzy relation equations based on Archimedean triangular norms
Fuzzy Sets and Systems
Fuzzy Relation Equations and Their Applications to Knowledge Engineering
Fuzzy Relation Equations and Their Applications to Knowledge Engineering
Multi-objective optimization problems with fuzzy relation equation constraints
Fuzzy Sets and Systems - Special issue: Optimization and decision support systems
A Note on Fuzzy Relation Programming Problems with Max-Strict-t-Norm Composition
Fuzzy Optimization and Decision Making
Fuzzy relation equations for coding/decoding processes of images and videos
Information Sciences—Informatics and Computer Science: An International Journal
Fuzzy Relation Equations (II): The Branch-point-solutions and the Categorized Minimal Solutions
Soft Computing - A Fusion of Foundations, Methodologies and Applications
On the relation between equations with max-product composition and the covering problem
Fuzzy Sets and Systems
An efficient solution procedure for fuzzy relation equations with max-product composition
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Fuzzy Systems
Latticized linear optimization on the unit interval
IEEE Transactions on Fuzzy Systems
On fuzzy relational equations and the covering problem
Information Sciences: an International Journal
The quadratic programming problem with fuzzy relation inequality constraints
Computers and Industrial Engineering
Hi-index | 0.21 |
Prior studies have demonstrated that one of the minimal solutions of a fuzzy relational equation with the max-Archimedean t-norm composition is an optimal solution of a linear objective function with positive coefficients. However, this property cannot be adopted to optimize the problem of a linear fractional objective function. This study presents an efficient method to optimize such a linear fractional programming problem. First, some theoretical results are developed based on the properties of max-Archimedean t-norm composition. The result is used to reduce the feasible domain. The problem can thus be simplified and converted into a traditional linear fractional programming problem, and eventually optimized in a small search space. A numerical example is provided to illustrate the procedure.