Abstract

Several new qualitative properties of the problem of minimizing the sum of the weighted minima of the Euclidean distances of the demand points to the facilities, which is called the multi-source Weber problem and also known as the clustering problem with Euclidean norms, are obtained in this paper. Nontrivial local solutions are defined and characterized with the help of a necessary optimality condition in DC programming and the special structure of the problem in question. Since most of the existing solution algorithms for this problem just give some local solutions, our characterizations can be used to analyse and refine these algorithms.

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 call

Disclaimer: 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.