Skip to main content

Global Optimization in Weber’s Problem with Attraction and Repulsion

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

See also

References

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Balas E, Yu CS (1982) A note on the Weiszfeld–Kuhn algorithm for the general Fermat problem. Managem Sci Res Report 484:1–6

    Google Scholar 

  2. Calamai PH, Conn AR (1980) A stable algorithm for solving the multifacility location problem involving Euclidean distances. SIAM J Sci Statist Comput 1:512–526

    Article  MathSciNet  MATH  Google Scholar 

  3. Calamai PH, Conn AR (1982) A second-order method for solving the continuous multifacility location problem. In: Numerical Analysis. Proc. 9th Biennial Conf. Dundee, Scotland, pp 1–25

    Google Scholar 

  4. Calamai PH, Conn AR (1987) A projected Newton method for lp norm location problems. Math Program 38:75–109

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen P-C, Hansen P, Jaumard B, Tuy H (1992) Weber's problem with attraction and repulsion. J Reg Sci

    Google Scholar 

  6. Drezner Z, Wesolowsky GO (1991) The Weber problem on the plane with some negative weights. INFOR 29:87–99

    MATH  Google Scholar 

  7. Horst R, Tuy H (1990) Global optimization, deterministic approaches. Springer, Berlin

    MATH  Google Scholar 

  8. Kuhn HW (1967) On a pair of dual nonlinear programs. Nonlinear Programming. North-Holland, Amsterdam, pp 38–54

    Google Scholar 

  9. Kuhn HW (1973) A note on Fermat's problem. Math Program 4:94–107

    Article  MathSciNet  Google Scholar 

  10. Kuhn HW (1974) Steiner's problem revisited. In: Studies in Optimization. Math. Assoc. America, Washington, DC, pp 52–70

    Google Scholar 

  11. Maranas CD, Floudas CA (1993) A global optimization method for Weber's problem with attraction and repulsion. In: Proc. Large Scale Optimization: State of the Art Conf., Florida Univ., 15-17 Feb. 1993. Kluwer, Dordrecht, pp 259–293

    Google Scholar 

  12. Ostresh LM (1978) On the convergence of a class of iterative methods for solving the Weber location problem. Oper Res 26:597–609

    Article  MathSciNet  MATH  Google Scholar 

  13. Overton ML (1983) A quadratically convergent method for minimizing a sum of Euclidean norms. Math Program 27:34–63

    Article  MathSciNet  MATH  Google Scholar 

  14. Plastria F (1992) The effects of majority in Fermat–Weber problems with attraction and repulsion. YUGOR 1

    Google Scholar 

  15. Rosen JB, Xue G-L (1991) Computational comparison of two algorithms for the Euclidean single facility location problem. ORSA J Comput 3:207–212

    MATH  Google Scholar 

  16. Tellier L-N (1972) The Weber problem: Solution and interpretation. Geographical Anal 4:215–233

    Google Scholar 

  17. Tellier L-N (1985) Économie patiale: rationalitée économique de l'espace habité. Gaétan Morin, Chicoutimi, Québec

    Google Scholar 

  18. Tellier L-N (1989) The Weber problem: frequency of different solution types and extension to repulsive forces and dynamic processes. J Reg Sci 29:387–405

    Article  Google Scholar 

  19. Tellier L-N, Ceccaldi X (1983) Phenomenes de polarization et de repulsion dans le context du probleme de Weber. Canad Regional Sci Assoc

    Google Scholar 

  20. Tuy H, Al-Khayyal FA (1992) Global optimization of a nonconvex single facility problem by sequential unconstrained convex minimization. J Global Optim 2:61–71

    Article  MathSciNet  MATH  Google Scholar 

  21. Tuy H, Al-Khayyal FA, Zhou F (1995) A D.C. optimization method for single facility location problems. J Global Optim 2:61–71

    Article  MathSciNet  Google Scholar 

  22. Wang CY (1975) On the convergence and rate of convergence of an iterative algorithm for the plant location problem. Qufu Shiyun Xuebao 2:14–25

    Google Scholar 

  23. Weiszfeld E (1937) Sur le point pour lequel la somme des distances de n points donnés est minimum. Tôhoku Math J 43:355–386

    Google Scholar 

  24. Witzgall C (1984) Optimal location of a single facility: Mathematical models and concepts. Report Nat Bureau Standards 8388

    Google Scholar 

  25. Xue G-L (1987) A fast convergent algorithm for \( { \text{min} \sum_{\text i = 1}^{\text m} \parallel {\text x} - {\text a}_{\text i} \parallel } \) on a closed convex set. J Qufu Normal Univ 13(3):15–20

    MATH  Google Scholar 

  26. Xue G-L (1989) A globally and quadratically convergent algorithm for \( { \text{min} \sum_{\text i = 1}^{\text m} \parallel {\text x} - {\text a}_{\text i} \parallel } \) type plant location problem. Acta Math Applic Sinica 12:65–72

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Maranas, C.D. (2008). Global Optimization in Weber’s Problem with Attraction and Repulsion . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_249

Download citation

Publish with us

Policies and ethics