In this note, we collect some interesting and useful results about the Weber problem. We investigate an accelerated Weiszfeld procedure which increases the step size and find a formula for the step size that empirically produces the fastest convergence rate. We also derive an estimate for the optimal cost of the system.
Unable to display preview. Download preview PDF.
- W. Domschke and A. Drexel,Location and Layout Planning, Lecture Notes in Economics and Mathematical Systems No. 238 (Springer, 1985).Google Scholar
- Z. Drezner and D. Simchi-Levi, Asymptotic behavior of the Weber location problem in the plane, this issue.Google Scholar
- R.L. Francis and J.A. White,Facility Layout and Location (Prentice-Hall, Englewood Cliffs, NJ, 1974).Google Scholar
- H.W. Kuhn, On a pair of dual non-linear problems, in:Non-Linear Programming, ed. J. Abadie (Wiley, New York, 1967).Google Scholar
- R.F. Love, J.G. Morris and G.O. Wesolowsky,Facilities Location Models and Methods (North-Holland, New York, 1988).Google Scholar
- E. Weiszfeld, Sur le point pour lequel la somme des distances den points donnés est minimum, Tohoku Math. J. 43(1937)355–386.Google Scholar