A Note on Fuzzy Relation Programming Problems with Max-Strict-t-Norm Composition
Fuzzy Optimization and Decision Making
Optimization of fuzzy relational equations with max-av composition
Information Sciences: an International Journal
Information Sciences: an International Journal
On the resolution and optimization of a system of fuzzy relational equations with sup-T composition
Fuzzy Optimization and Decision Making
Optimization of linear objective function with max-t fuzzy relation equations
Applied Soft Computing
Minimizing a nonlinear function under a fuzzy max-t-norm relational equation constraint
Expert Systems with Applications: An International Journal
Journal of Computational and Applied Mathematics
Latticized linear optimization on the unit interval
IEEE Transactions on Fuzzy Systems
Minimizing a linear objective function under a fuzzy max-t norm relation equation constraint
Information Sciences: an International Journal
Multi-objective optimization with a max-t-norm fuzzy relational equation constraint
Computers & Mathematics with Applications
Fuzzy Optimization and Decision Making
The quadratic programming problem with fuzzy relation inequality constraints
Computers and Industrial Engineering
Randomly generating test problems for fuzzy relational equations
Fuzzy Optimization and Decision Making
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Linear optimization with an arbitrary fuzzy relational inequality
Fuzzy Sets and Systems
Linear optimization with bipolar max-min constraints
Information Sciences: an International Journal
Linear optimization problem constrained by fuzzy max-min relation equations
Information Sciences: an International Journal
An algorithm for solving optimization problems with fuzzy relational inequality constraints
Information Sciences: an International Journal
Hi-index | 0.00 |
In literature, the optimization model with a linear objective function subject to fuzzy relation equations has been converted into a 0-1 integer programming problem by Fang and Li (1999). They proposed a jump-tracking branch-and-bound method to solve this 0-1 integer programming problem. In this paper, we propose an upper bound for the optimal objective value. Based on this upper bound and rearranging the structure of the problem, we present a backward jump-tracking branch-and-bound scheme for solving this optimization problem. A numerical example is provided to illustrate our scheme. Furthermore, testing examples show that the performance of our scheme is superior to the procedure in the paper by Fang and Li. Several testing examples show that our initial upper bound is sharp.