A maxmin location problem with nonconvex feasible region

A maxmin location problem with nonconvex feasible region

0.00 Avg rating0 Votes
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: , ,
Keywords: programming: mathematical
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.