General models in min-max continous location: Theory and solution techniques

In this paper, a class of min-max continuous location problems is discussed. After giving a complete characterization of th stationary points, we propose a simple central and deep-cut ellipsoid algorithm to solve these problems for the quasiconvex case. Moreover, an elementary convergence proof of this algorithm and some computational results are presented.The work of the second author was supported by JNICT (Portugal), under Contract BD/631/90-RM, during his stay at Erasmus University in Rotterdam.The authors would like to thank the anonymous referees for simplifying the proofs in the first part of Section 2 and for their constructive remarks improving the presentation.