General Models in Min-Max Continuous Location: Theory and Solution Techniques

Abstract. In this paper, a class of min-max continuous location prob-lems is discussed. After giving a complete characterization f the station-ary points, we propose a simple central and deep-cut ellipsoid algorithm to solve these problems for the quasiconvex case. Moreover, an elemen-tary convergence proof of this algorithm and some computational results are presented. Key Words. Location theory, min-max programming, ellipsoid algo-rithm, quasiconvexity. 1