The aim of thiswork is to locate a semi-obnoxious facility, i.e. tominimize the distances
to a given set of customers in order to save transportation costs on the one hand and to
avoid undesirable interactions with other facilities within the region by maximizing
the distances to the corresponding facilities on the other hand. Hence, the goal is to
satisfy economic and environmental issues simultaneously. Due to the contradicting
character of these goals, we obtain a non-convex objective function. We assume that
distances can be measured by rectilinear distances and exploit the structure of this
norm to obtain a very efficient dual pair of algorithms
