Skip to main content
Log in

Location Problems with Different Norms for Different Points

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Given a finite set \(A=\{a_1,\dots,{a_n}\}\) in a linear space X, we consider two problems. The first problem consists of finding the points minimizing the maximum distance to the points in A; the second problem looks for the points that minimize the average distance to the points in A. In both cases, we assume that the distances at different points are defined as

$$ d(x,{a_i})=\|x-{a_i}\|_i,\quad for i=1,\dots,n, $$

with norms \(\|\cdot \|_i\) defined on X. The use of different norms to measure distances from different points allows us to extend some results that hold in the single-norm case, while some strange and rather unexpected facts arise in the general case.

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

Access this article

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. E. Carrizosa J. Puerto (1995) ArticleTitle A Discretizing Algorithm for Location Problems European Journal of Operational Research 80 166–174 Occurrence Handle10.1016/0377-2217(93)E0145-N

    Article  Google Scholar 

  2. R. Durier (1995) ArticleTitle The General One-Center Location Problem Mathematics of Operations Research 20 400–414

    Google Scholar 

  3. R. Durier C. Michelot (1985) ArticleTitle Geometrical Properties of the Fermat–Weber Problem European Journal of Operational Research 20 332–343 Occurrence Handle10.1016/0377-2217(85)90006-2

    Article  Google Scholar 

  4. R. Durier (1990) ArticleTitleOn Pareto Optima, the Fermat-Weber Problem, and Polyhedral Gauges Mathematical Programming 47 65–79 Occurrence Handle10.1007/BF01580853

    Article  Google Scholar 

  5. R. Durier (1992) A General Framework for the One-Center Location Problem NumberInSeriesVol. 382 Springer New York, NY 441–457

    Google Scholar 

  6. S. Nickel (1995) Discretization of Planar Location Problems Verlag Shaker Aachen,Germany

    Google Scholar 

  7. J. B. G. Frenk J. Gromicho S. Zhang (1996) ArticleTitle General Models in Min-Max Continuous Location: Theory and Solution Techniques Journal of Optimization Theory and Applications 89 39–63

    Google Scholar 

  8. J. B. G. Frenk J. Gromicho S. Zhang (1996) ArticleTitle General Models in Min-Max Planar Location: Checking Optimality Conditions Journal of Optimization Theory and Applications 89 65–87

    Google Scholar 

  9. J. Gromicho (1998) Quasiconvex Optimization and Location Theory NumberInSeriesVol. 9 Kluwer Academic Publishers Dordrecht,Holland

    Google Scholar 

  10. M. Parlar (1994) ArticleTitle Single-Facility Location Problems with Region-Dependent Distance Metrics International Journal of System Sciences 25 513–525

    Google Scholar 

  11. Z. Drezner G. O. Wesolowski (2002) ArticleTitle Sensitivity Analysis to the Value of p of the l p Distance Weber Problem Annals of Operations Research 111 135–150 Occurrence Handle10.1023/A:1020949602625

    Article  Google Scholar 

  12. R. E. Wendell A. P. Hurter SuffixJr. (1973) ArticleTitle Location Theory, Dominance, and Convexity Operations Research 21 314–320

    Google Scholar 

  13. P. Hansen J. Perreur J. F. Thisse (1980) ArticleTitle Location Theory, Dominance, and Convexity: Some Further Results Operations Research 28 1241–1250

    Google Scholar 

  14. E. Carrizosa F. R. Fernàndez (1993) ArticleTitle A Polygonal Upper Bound for the Efficient Set for Single-Facility Location Problems with Mixed Norms TOP 1 107–116

    Google Scholar 

  15. A. M. Rodríguez-chía J. Puerto (2002) ArticleTitle Geometrical Description of the Weakly Efficient Solution Set for the Multicriteria Location Problem Annals of Operations Research 111 181–196 Occurrence Handle10.1023/A:1020905820371

    Article  Google Scholar 

  16. Papini, P.L., Existence of Centers and Medians, 2004 TOP, 2004 (to appear).

  17. Abadie, J., Editor, Nonlinear Programming, North-Holland, Amsterdam, Holland, 1967.

  18. Gritzman P., and KLEE, V., Mathematical Programming and Convex Geometry, Handbook of Convex Geometry, Vol. A, Edited by P. M. Gruber and J. M. Wills, North-Holland, Amsterdam, Holland, 1993.

  19. T. Domínguez-benavides (1991) ArticleTitleNormal Structure Coefficients of Lp(Ω) Proceedings of the Royal Society of Edimburgh 117A 299–303

    Google Scholar 

  20. P. L. Papini (1994) ArticleTitleHow Can We Locate Centers? Studies on Locational Analysis 7 143–152

    Google Scholar 

  21. M. Baronti P. L. Papini (2001) ArticleTitle Remotal Sets Revisited Taiwanese Journal of Mathematics 5 367–373

    Google Scholar 

  22. M. Baronti E. Casini P. L. Papini (1996) ArticleTitleCentral Points of Finite Sets,Rendiconti del Circolo Matematico di Palermo (II) Supplemento 40 63–72

    Google Scholar 

  23. H. Martini K. J. Swanepoel G. Weiss (2002) ArticleTitle The Fermat-Torricelli Problem in Normed Planes and Spaces Journal of Optimization Theory and Applications 115 283–314 Occurrence Handle10.1023/A:1020884004689

    Article  Google Scholar 

  24. D. Cieslik (1998) Steiner Minimal Trees NumberInSeriesVol. 23 Kluwer Dordrecht Holland

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The research of the first author was supported by the Italian National Group GNAMPA.

The research of the second author was supported by the Spanish Ministry of Science and Technology through Grant BFM2001-2378, MTM2004:0909

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papini, P.L., Puerto, J. Location Problems with Different Norms for Different Points. J Optim Theory Appl 125, 673–695 (2005). https://doi.org/10.1007/s10957-005-2095-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-005-2095-1

Keywords

Navigation