In this paper we consider the problem of finding the maximum Chebyshev
distance which can be travelled from a given point whilst remaining i
n the feasible region of a given set of constraints. We describe an im
provement to an existing algorithm for this problem and demonstrate it
s effectiveness.