| Article ID: | iaor1995725 |
| Country: | United Kingdom |
| Volume: | 21 |
| Issue: | 10 |
| Start Page Number: | 1069 |
| End Page Number: | 1072 |
| Publication Date: | Dec 1994 |
| Journal: | Computers and Operations Research |
| Authors: | Proll L.G., Salhi A. |
| Keywords: | decision theory: multiple criteria |
In this paper the authors consider the problem of finding the maximum Chebyshev distance which can be travelled from a given point whilst remaining in the feasible region of a given set of constraints. They describe an improvement to an existing algorithm for this problem and demonstrate its effectiveness.