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.
|Keywords||ellipsoid algorithm, location theory, min-max programming, quasiconvexity|
|Persistent URL||dx.doi.org/10.1007/BF02192640, hdl.handle.net/1765/11538|
Frenk, J.B.G., Gromicho, J.A.S., & Zhang, S.. (1996). General models in min-max continous location. Journal of Optimization Theory and Applications, 89, 39–63. doi:10.1007/BF02192640