Large region location problems

Abstract The paper describes two algorithms for solving single facility location problems in which the planar assumption is not appropriate. Transformations on the non-Euclidean spherical space are combined with efficient solution techniques in En. An example problem illustrates the possible magnitude of error due to a planar assumption for a non-Euclidean space. Due to the nature of the problem (non convexity) a local optimum is obtained. Some computational experience is reported.