| Article ID: | iaor19981940 |
| Country: | United Kingdom |
| Volume: | 7 |
| Issue: | 3 |
| Start Page Number: | 219 |
| End Page Number: | 231 |
| Publication Date: | Jul 1996 |
| Journal: | IMA Journal of Mathematics Applied in Business and Industry |
| Authors: | White D.J. |
| Keywords: | heuristics |
In this paper, the nonconvex form of the weighted maxmin dispersion problem is converted to a form involving the maximization of convex functions over a polytope, for which algorithms exist. A heuristic approach is given, together with associated results on optimality and bounds on loss of optimality.