Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function

James G. Morris
Additional contact information
James G. Morris: University of Wisconsin, Madison, Wisconsin

Operations Research, 1981, vol. 29, issue 1, 37-48

Abstract: This paper considers a generalization of the single and multisource Weber problem for the case when the “distance” function is some power K of the usual I p distance. Properties of the generalized problem are established, and an appropriate generalization of the Weiszfeld iterative approach is given. A convergence proof is supplied for an ϵ-approximation to the original problem, under certain restrictions on p and K .

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.1.37 (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:29:y:1981:i:1:p:37-48

Access Statistics for this article

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