Efficient location for a semi-obnoxious facility (Q1417713)

A facility must be located in a given planar region taking two objectives into account; push: maximise the distance to the closest inhabitant, and pull: minimise the sum or maximum of distances to a set of users. A general construction method of the full set of efficient (Pareto optimal) solutions is described, and shown to be applicable, using computational geometry techniques based on Voronoi diagrams, to efficiently solve two cases: elliptic push distance combined with summed rectangular pull-distances, and rectangular push distance combined with max of rectangular pull-distances.