Abstract
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(n 2) in the worst case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.A. Aly, D.C. Kay, and D.W. Litwhiler, “Location dominance on spherical surfaces,” Operations Research, vol. 27, pp. 972–981, 1979.
R.K. Chakraborty and P.K. Chaudhuri, “Note on geometrical solutions for some minimax location problems,” Transportation Science, vol. 15, pp. 164–166, 1981.
Z. Drezner, “On location dominance on spherical surfaces,” Operations Research, vol. 29, pp. 1218–1219, 1981.
Z. Drezner, “Constrained location problems in the plane and on a sphere,” IEE Transactions, vol. 15, pp. 300–304, 1983.
Z. Drezner and G.O. Wesolowsky, “Facility location on a sphere,” The Journal of the Operational Research Society, vol. 29, pp. 997–1004, 1979.
Z. Drezner and G.O. Wesolowsky, “Minimax and maximin facility location problems on a sphere,” Naval Research Logistics Quarterly, vol. 30, pp. 305–312, 1983.
J. Elzinga and D.W. Hearn, “Geometrical solutions for some minimax location problems,” Transportation Science, vol. 6, pp. 379–394, 1972.
R.L. Francis, L.F. McGinnis, and J.A. White, Facility Layout and Location: An Analytical Approach, Second Edition, Prentice-Hall: Englewood Cliffs, NJ, 1992.
D.W. Hearn and Vijay, “Efficient algorithms for the (weighted) minimum circle problem,” Operations Research, vol. 30, pp. 777–795, 1982.
I.N. Katz and L. Cooper, “Optimal location on a sphere,” Computational Mathematics and Applications, vol. 6, pp. 175–196, 1980.
D.W. Litwhiler, “Large region location problem,” Ph.D. Thesis, The University of Oklahoma: Norman, OK, 1977.
D.W. Litwhiler and A.A. Aly, “Minimax facility location problem on the spheres,” I.E. Research Report, pp. 81–12 (School of Industrial Engineering), University of Oklahoma: Norman, OK, 1981.
N. Megiddo, “Linear time algorithm for linear programming in R 3and related problems,” SIAM J. Comput. vol. 12, pp. 759–776, 1983.
K.P.K. Nair and R. Chandrasekaran, “Optimal location of a single service center of certain types,” Naval Research Logistics Quarterly, vol. 18, pp. 503–510, 1971.
B.J. Oommen, “An efficient geometric solution to minimum spanning circle problem,” Operations Research, vol. 35, pp. 80–86, 1987.
M.H. Patel, “Spherical minimax location problem using the euclidean norm: Formulation and optimization,” Computational Optimization and Applications, vol. 4, pp. 79–90, 1995.
M.H. Patel, D.L. Nettles, and S.J. Deutsch, “A linear programming-based method for determining whether or not n demand points are on a hemisphere,” Naval Research Logistics, vol. 40, pp. 543–552, 1993.
M.I. Shamos, “Computational geometry,” Ph.D. Thesis, Dept. of Computer Science, Yale University, 1978.
I. Todhunter and J.G. Leathem, Spherical Trigonometry, Macmillan & Co. Ltd.: London 1960.
W.M. Tsai, M.S. Chern, and T.M. Lin, “An algorithm for determining whether m demand points are on a hemisphere or not,” Transportation Science, vol. 25, pp. 91–97, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sarkar, A.K., Chaudhuri, P.K. Solution of an equiweighted minimax location problem on a hemisphere. Comput Optim Applic 6, 73–82 (1996). https://doi.org/10.1007/BF00248010
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00248010