| Article ID: | iaor20042975 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 4 |
| Start Page Number: | 637 |
| End Page Number: | 643 |
| Publication Date: | Apr 2004 |
| Journal: | Computers and Operations Research |
| Authors: | Gass Saul I., Witzgall Christoph |
| Keywords: | programming: linear |
We show how the Chebychev minimax criterion for finding a circle closest to a set of points can be approximated well by standard linear programming procedures.