p-Median theorems for competitive locations
In competitive location theory, one wishes to optimally choose the locations ofr facilities to compete againstp existing facilities for providing service (or goods) to the customers who are at given discrete points (or nodes). One normally assumes that: (a) the level of demand of each customer is fixed (i.e. this demand is not a function of how far a customer is from a facility), and (b) the customer always uses the closest available facility. In this paper we study competitive locations when one or both of the above assumptions have been relaxed. In particular, we show that for each case and under certain assumptions, there exists a set of optimal locations which consists entirely of nodes.
Keywords and phrasesp-median spatial competition network elastic demand
Unable to display preview. Download preview PDF.
- N. Megiddo, E. Zemel and S.L. Hakimi, The maximum coverage location problem, SIAM J. on Algebraic and Discrete Methods 4, 2(1983)253.Google Scholar
- P.J. Slater, Maximum facility location, J. Res. Natl. Bur. of Standards, Series B (1975) 107.Google Scholar
- R.E. Wendell and A.P. Hurter, Optimum locations in networks, Transportation Science 7(1973)18.Google Scholar
- M. Penn, O. Kariv and J. Halpern, Competitive locations in trees, unpublished paper (1982), Dept. of Industrial and Management Engineering, Technicon, Haifa, Israel.Google Scholar
- S.L. Hakimi, Locations with spatial interactions: Competitive locations and games, in:Discrete Location Theory, ed. R.L. Francis and P.B. Mirchandani (Wiley, New York, 1986) to appear.Google Scholar