Qualitative Analysis and Adaptive Boosted DCA for Generalized Multi-Source Weber Problems (2409.13635v1)

Abstract: This paper has two primary objectives. First, we investigate fundamental qualitative properties of the generalized multi-source Weber problem formulated using the Minkowski gauge function. This includes proving the existence of global optimal solutions, demonstrating the compactness of the solution set, and establishing optimality conditions for these solutions. Second, we apply Nesterov's smoothing and the adaptive Boosted Difference of Convex functions Algorithm (BDCA) to solve both the unconstrained and constrained versions of the generalized multi-source Weber problems. These algorithms build upon the work presented in [6,19]. We conduct a comprehensive evaluation of the adaptive BDCA, comparing its performance to the method proposed in [19], and provide insights into its efficiency.