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 lp 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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
