Abstract
The asymptotic behavior of the Weber location problem is investigated. We consider problems wheren demand points are randomly generated in a unit disk by a uniform distribution and all weights are equal to one. The main result of the paper is that the probability that the optimal solution be on a demand point is approximately 1/n. Additional results for a largen: the optimal solution converges almost surely to the center of the disk; the difference between the optimal value of the objective function and the minimal value of the objective function on a demand point converges to 1/2.
Similar content being viewed by others
References
W.H. Beyer,CRC Standard Mathematical Tables, 26th ed. (CRC Press, Boca Raton, FL, 1981).
W. Domschke and A. Drexl,Location and Layout Planning, Lecture Notes in Economics and Mathematical Systems, No. 238 (Springer, 1985).
Z. Drezner, Sensitivity analysis of the optimal location of a facility, Naval Res. Logist. Quart. 32(1985)209–224.
R.L. Francis and J.A. White,Facility Layout and Location (Prentice-Hall, Englewood Cliffs, NJ, 1974).
I.N. Katz, Local convergence in Fermat's problem, Math. Progr. 6(1974)89–104.
H.W. Kuhn, A note on Fermat's problem, Math. Progr. 4(1973)98–107.
R.F. Love and J.G. Morris, Solving constrained multi-facility location problems involvingl p distances using convex programming, Oper. Res. 23(1975)581–587.
E. Weiszfeld, Sur le point pour lequel la somme des distances den points donnés est minimum, Tohoku Math. J. 43(1937)355–386.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Drezner, Z., Simchi-Levi, D. Asymptotic behavior of the Weber location problem on the plane. Ann Oper Res 40, 163–172 (1992). https://doi.org/10.1007/BF02060475
Issue Date:
DOI: https://doi.org/10.1007/BF02060475