Skip to main content
Log in

Local convergence in a generalized Fermat-Weber problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In the Fermat-Weber problem, the location of a source point in ℝN is sought which minimizes the sum of weighted Euclidean distances to a set of destinations. A classical iterative algorithm known as the Weiszfeld procedure is used to find the optimal location. Kuhn proves global convergence except for a denumerable set of starting points, while Katz provides local convergence results for this algorithm. In this paper, we consider a generalized version of the Fermat-Weber problem, where distances are measured by anl p norm and the parameterp takes on a value in the closed interval [1, 2]. This permits the choice of a continuum of distance measures from rectangular (p=1) to Euclidean (p=2). An extended version of the Weiszfeld procedure is presented and local convergence results obtained for the generalized problem. Linear asymptotic convergence rates are typically observed. However, in special cases where the optimal solution occurs at a singular point of the iteration functions, this rate can vary from sublinear to quadratic. It is also shown that for sufficiently large values ofp exceeding 2, convergence of the Weiszfeld algorithm will not occur in general.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Brimberg, Properties of distance functions and minisum location models, Ph.D. Thesis, McMaster University, Hamilton, Canada (1989).

    Google Scholar 

  2. A.V. Cabot, R.L. Francis and M.A. Stary, A network flow solution to a rectilinear distance facility location problem, AIIE Trans. 2(1970)132–141.

    Google Scholar 

  3. R. Chandrasekaran and A. Tamir, Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem, Math. Progr. 44(1989)293–295.

    Article  Google Scholar 

  4. L. Cooper, Location-allocation problems, Oper. Res. 11(1963)37–52.

    Article  Google Scholar 

  5. G. Dahlquist and Å. Björck,Numerical Methods, transl. by N. Anderson (Prentice-Hall, Englewood Cliffs, NJ, 1974).

    Google Scholar 

  6. D.T. Finkbeiner,Elements of Linear Algebra (W.H. Freeman, San Francisco, CA, 1972).

    Google Scholar 

  7. H. Juel and R.F. Love, Fixed point optimality criteria for the location problem with arbitrary norms, J. Oper. Res. Soc. 32(1981)891–897.

    Article  Google Scholar 

  8. I.N. Katz, Local convergence in Fermat's problem, Math. Progr. 6(1974)89–104.

    Article  Google Scholar 

  9. H.W. Kuhn, A note on Fermat's problem, Math. Progr. 4(1973)98–107.

    Article  Google Scholar 

  10. H.W. Kuhn and R.E. Kuenne, An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics, J. Regional Sci. 4(1962)21–34.

    Article  Google Scholar 

  11. R.F. Love and J.G. Morris, Modelling inter-city road distances by mathematical functions, Oper. Res. Quarterly 23(1972)61–71.

    Article  Google Scholar 

  12. R.F. Love and J.G. Morris, Mathematical models of road travel distances, Manag. Sci. 25(1979)130–139.

    Article  Google Scholar 

  13. R.F. Love, J.G. Morris and G.O. Wesolowsky,Facilities Location: Models and Methods (North-Holland, New York, 1988).

    Google Scholar 

  14. W. Miehle, Link-length minimization in networks, Oper. Res. 6(1958)232–243.

    Article  Google Scholar 

  15. J.G. Morris, Analysis of generalized empirical “distance” function for use in location problems,Int. Symp. on Locational Decisions, Banff, Alberta (1978).

  16. J.G. Morris, Convergence of the Weiszfeld algorithm for Weber problems using a generalized “distance” function, Oper. Res. 29(1981)37–48.

    Article  Google Scholar 

  17. J.G. Morris and W.A. Verdini, Minisuml p distance location problems solved via a perturbed problem and Weiszfeld's algorithm, Oper. Res. 27(1979)1180–1188.

    Article  Google Scholar 

  18. J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).

    Google Scholar 

  19. L.M. Ostresh, On the convergence of a class of iterative methods for solving the Weber location problem, Oper. Res. 26(1978)597–609.

    Article  Google Scholar 

  20. J.-C. Picard and H.D. Ratliff, A cut approach to the rectilinear distance facility location problem, Oper. Res. 26(1978)422–433.

    Article  Google Scholar 

  21. J.-F. Thisse, J.E. Ward and R.E. Wendell, Some properties of location problems with block and round norms, Oper. Res. 32(1984)1309–1327.

    Article  Google Scholar 

  22. E. Weiszfeld, Sur le point lequel la somme des distances den points donnés est minimum, Tohoku Math. J. 43(1937)355–386.

    Google Scholar 

  23. G.O. Wesolowsky and R.F. Love, The optimal location of new facilities using rectangular distances, Oper. Res. 19(1971)124–130.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brimberg, J., Love, R.F. Local convergence in a generalized Fermat-Weber problem. Ann Oper Res 40, 33–66 (1992). https://doi.org/10.1007/BF02060469

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02060469

Keywords

Navigation