Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- 1 February 1981
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 29 (1) , 37-48
- https://doi.org/10.1287/opre.29.1.37
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 Ip 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.This publication has 0 references indexed in Scilit: