Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances

Jack Brimberg and Robert F. Love
Additional contact information
Jack Brimberg: Royal Military College, Kingston, Ontario, Canada
Robert F. Love: McMaster University, Hamilton, Ontario, Canada

Operations Research, 1993, vol. 41, issue 6, 1153-1163

Abstract: This paper considers a general form of the single facility minisum location problem (also referred to as the Fermat-Weber problem), where distances are measured by an l p norm. An iterative solution algorithm is given which generalizes the well-known Weiszfeld procedure for Euclidean distances. Global convergence of the algorithm is proven for any value of the parameter p in the closed interval [1, 2], provided an iterate does not coincide with a singular point of the iteration functions. However, for p > 2, the descent property of the algorithm and as a result, global convergence, are no longer guaranteed. These results generalize the work of Kuhn for Euclidean ( p = 2) distances.

Keywords: facilities/equipment planning; location; continuous: convergence of a procedure for location with lp distances (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.41.6.1153 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:41:y:1993:i:6:p:1153-1163

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().