For unsolvable systems of the form A
x = b over the max-min algebra
R = ([0, 1], = max,
= min), we propose an efficient method to find
a Chebychev-best approximation, say b, from vector b in the set S(A) = {bb 2
R(m);A
x =bb is solvable}. Besides, to test the method we propose an algorithm.
