Article ID: | iaor19982613 |
Country: | United Kingdom |
Volume: | 48 |
Issue: | 5 |
Start Page Number: | 479 |
End Page Number: | 489 |
Publication Date: | May 1997 |
Journal: | Journal of the Operational Research Society |
Authors: | Puerto J., Fernndez-Rodrguez Fernando, Rodriguez-Chia A.M. |
Keywords: | programming: mathematical |
The problem dealt with consists of locating a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of convex polyhedra representing protected areas around population points. The paper describes a finite dominating solution set for the optimal solution and develops a geometrical procedure for obtaining the optimal solution comparing a finite number of candidates.