Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case

Abstract

In this paper we address the problem of finding Simpson points in planar models with locational constraints when distances are measured by polyhedral gauges. Making use of the results we have stated in a previous paper, we show here the existence of a finite set of points in the plane, independent of the weights associated with the users, that contains at least a Simpson point. Connection between Simpson points (as a result of a voting process) and Weber points (as the outcome of a planning process) are explored. It is shown by means of an example that the existing relations for the unconstrained case are no longer true when locational constraints are imposed. In order to reconcile both voting and planning processes, a biobjective problem is described, for which we construct a finite dominating set.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 15 citations exist upstream.