Abstract
The objective of this research is to develop a procedure that will solve, contingent on a necessary and sufficient optimality condition, the planar k-centra single facility location problem with Euclidean distances. The planar k-centra lo- cation problem seeks to find a location that minimizes the sum of the Euclidean distances to the k furthest existing facili- ties. The intrigue herein lies in the inability to define the k furthest away a priori of determining the associated median lo- cation. Hence, an iterative procedure is developed that can lead to optimal solutions but is subject to degeneracy. Results suggest that this degeneracy is instantiation specific to the k-centra location problem.
Sign-in/Register to access full text options 
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 callMore From: The Open Industrial & Manufacturing Engineering Journal
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.
