Solution of an equiweighted minimax location problem on a hemisphere

A particular continuous single facility minimax location problem on the surface of a hemisphere is discussed. We assume that all the demand points are equiweighted. An algorithm, based on spherical trigonometry, for finding the minimax point is presented. The minimax point thus obtained is unique and the algorithm is O(n2) in the worst case.

[1]  Zvi Drezner.  Technical Note - On Location Dominance on Spherical Surfaces , 1981, Oper. Res..

[3]  Zvi Drezner,et al.  Minimax and maximin facility location problems on a sphere , 1983 .

[4]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  B. John Oommen.  An Efficient Geometric Solution to the Minimum Spanning Circle Problem , 1987, Oper. Res..

[6]  G. O. Wesolowsky,et al.  Facility Location on a Sphere , 1978 .

[7]  Z. Drezner.  Constrained Location Problems in the Plane and on a Sphere , 1983 .

[8]  K. Nair,et al.  Optimal location of a single service center of certain types , 1971 .

[9]  Donald W. Hearn,et al.  Efficient Algorithms for the (Weighted) Minimum Circle Problem , 1982, Oper. Res..

[10]  Wen-Hsien Tsai,et al.  Technical Note - An Algorithm for Determining Whether m Given Demand Points Are on a Hemisphere or Not , 1991, Transp. Sci..

[11]  Adel A. Aly,et al.  Large region location problems , 1979, Comput. Oper. Res..

[12]  P. K. Chaudhuri,et al.  Letter to the Editor---Note on Geometrical Solution for Some Minimax Location Problems , 1981 .

[13]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[14]  Minnie H. Patel.  Spherical minimax location problem using the Euclidean norm: Formulation and optimization , 1995, Comput. Optim. Appl..

[15]  L. Cooper,et al.  Optimal location on a sphere , 1980 .