An accelerated approach for solving fuzzy relation equations with a linear objective function

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. 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 do indeed show that our initial upper bound is sharp.