Equivalent Primal and Dual Differentiable Reformulations of the Euclidean Multifacility Location Problem
ثبت نشده
چکیده
As introduced earlier, the Euclidean Multifacility Location Problem (EMFLP) seeks to locate n new facilities at some points (xi, yi), i = 1, .., n in R 2 , in the presence of some m existing facilities located at specified points (aj, bj), j = 1, .., m, given certain interaction weights wij > 0 between designated pairs (i, j) of new and existing facilities in some indexpair set A NE , as well as certain interaction weights vkl > 0 between designated pairs (k, l), k < l, of new facilities themselves in some index-pair set ANN. The cost for each pair of interacting facilities is assumed to be directly proportional to the interaction weight and the Euclidean distance that separates these facilities. This problem may be mathematically stated as follows:
منابع مشابه
Multifacility Minimax Location Problems via Multi-Composed Optimization
We present a conjugate duality approach for multifacility minimax location problems with geometric constraints, where the underlying space is Fréchet and the distances are measured by gauges of closed convex sets. Besides assigning corresponding conjugate dual problems, we derive necessary and sufficient optimality conditions. Moreover, we introduce a further dual problem with less dual variabl...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملSolution of Backup Multifacility Location Problem by Considering the Ideal Radius for each Customer
In this paper we introduce a new facility location model, called backup multifacility location problem by considering the ideal radius for each customer. In this problem the location of clients are given in the plane. A radius is assigned to each client. We should find the location of new facilities, which some of them may fail with a given probability, such that the sum of weighted distances f...
متن کاملAn Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
In recent years rich theories on polynomial-time interior-point algorithms have been developed. These theories and algorithms can be applied to many nonlinear optimization problems to yield better complexity results for various applications. In this paper, the problem of minimizing a sum of Euclidean norms is studied. This problem is convex but not everywhere differentiable. By transforming the...
متن کاملA Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
We consider the problem of minimizing a sum of Euclidean norms, f(x) = ∑m i=1 ‖bi− Ai x‖. This problem is a nonsmooth problem because f is not differentiable at a point x when one of the norms is zero. In this paper we present a smoothing Newton method for this problem by applying the smoothing Newton method proposed by Qi, Sun, and Zhou [Math. Programming, 87 (2000), pp. 1–35] directly to a sy...
متن کامل