Skip to main content
Log in

An Extended Multifacility Minimax Location Problem Revisited

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

Abstract

We consider the following model of Drezner (1991) for the location of several facilities. The weighted sum of distances to all facilities plus a set-up cost is calculated for each separate demand point. The maximal value among these sums is to be minimized. In this note we show that if the weights used in the model decompose into a product of two factors, one depending only on the demand point, the other only on the new facilities, there exists at least one optimal solution such that all new facilities coincide. We also investigate when a unique optimal solution of coincidence type exists, and obtain a full description of the set of optimal solutions when the weights have this multiplicative structure and the norm is round. An example shows that this kind of coincidence does not necessarily happen when the weights may have any value.

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. O. Berman and B. Jewkes, OptimalM/G/1 server location on a network having a fixed facility, Journal of the Operations Research Society 39 (1988) 1137-1146.

    Google Scholar 

  2. M.M. Day, Strict convexity and smoothness, Transactions of the American Mathematical Society 78 (1955) 516-528.

    Google Scholar 

  3. M.M. Day, Normed Linear Spaces, Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 21 (Springer, Berlin, 1962).

    Google Scholar 

  4. Z. Drezner, The weighted minimax location problem with set-up costs and extensions, Recherche Opérationnelle/Operations Research 25 (1991) 55-64.

    Google Scholar 

  5. J.B.G. Frenk, J. Gromicho and S. Zhang, General models in min-max continuous location: theory and solution techniques, Journal of Optimization Theory and Applications 89 (1996) 39-63.

    Google Scholar 

  6. H.F. Idrissi, O. Lefebvre and C. Michelot, Applications and numerical convergence of the partial inverse method, in: Optimisation-Fifth French-German Conference, Castel Novel, 1988, Lecture Notes in Mathematics, Vol. 1405 (Springer, Berlin, 1989) 39-54.

    Google Scholar 

  7. B. Pelegrin, C. Michelot and F. Plastria, On the uniqueness of optimal solutions in continuous location theory, European Journal of Operational Research 20 (1985) 327-331.

    Google Scholar 

  8. R.R. Phelps, Convex sets and nearest points, Proceedings of the American Mathematical Society 9 (1958) 867-873.

    Google Scholar 

  9. F. Plastria, Points efficaces en localisation continue, Cahiers du C.E.R.O. 25 (1983) 229-332.

    Google Scholar 

  10. F. Plastria, Localization in single facility location, European Journal of Operational Research 18 (1984) 215-219.

    Google Scholar 

  11. F. Plastria, Continuous location problems, in: Facility Location: A Survey of Applications and Methods, ed. Z. Drezner (Springer, New York, 1995) pp. 225-262.

    Google Scholar 

  12. F. Plastria, Fully geometric solutions to some planar minimax location problems, Studies in Locational Analysis 7 (1995) 171-183.

    Google Scholar 

  13. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Michelot, C., Plastria, F. An Extended Multifacility Minimax Location Problem Revisited. Annals of Operations Research 111, 167–179 (2002). https://doi.org/10.1023/A:1020953703533

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020953703533

Navigation