This paper discusses the problem of locating a single obnoxious or undesirable facility so as to maximize its rectilinear distance from a given set of existing facilities. An outline of published linear programming methods is given. Based on these ideas we present an algorithm which exploits known properties of the optimal solution and does not use linear programming at all.
No takes yet. Share an insight, caveat, or question.
Appa et al. (1994) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: