New Second-Order Conical Programming Approaches to the Multi-Source Weber Optimization Problem

In this research, we propose two new models for the Multi-source Weber Problem (MWP) which have continuous convex and differentiable relaxation, favorable characteristics and which proved to be very relevant regarding the computational results in the clustering problems which inspired the methodology used. We present a proposal to extend this methodology to the Multi-source Weber Problem (MWP), which is a variation of the Fermat-Weber Problem, proposing new formulations combining a discretization presented in this work and another using the DC Programming technique.