General models in min-max planar location
Checking optimality conditions
This paper studies the problem of deciding whether the present iteration point of some algorithm applied to a planar singlefacility min-max location problem, with distances measured by either anl p -norm or a polyhedral gauge, is optimal or not. It turns out that this problem is equivalent to the decision problem of whether 0 belongs to the convex hull of either a finite number of points in the plane or a finite number of differentl q -circles . Although both membership problems are theoretically solvable in polynomial time, the last problem is more difficult to solve in practice than the first one. Moreover, the second problem is solvable only in the weak sense, i.e., up to a predetermined accuracy. Unfortunately, these polynomial-time algorithms are not practical. Although this is a negative result, it is possible to construct an efficient and extremely simple linear-time algorithm to solve the first problem. Moreover, this paper describes an implementable procedure to reduce the second decision problem to the first with any desired precision. Finally, in the last section, some computational results for these algorithms are reported.
|Keywords||Newton-Raphson method, computational geometry, continuous location theory, convex hull, optimality conditions|
|Persistent URL||dx.doi.org/10.1007/BF02192641, hdl.handle.net/1765/11539|
Frenk, J.B.G., Gromicho, J.A.S., & Zhang, S.. (1996). General models in min-max planar location. Journal of Optimization Theory and Applications, 65–87. doi:10.1007/BF02192641