Convex ordered median problem with lp-norms

被引：9

作者：

Espejo, I. ^{[1
]}

Rodriguez-Chia, A. M. ^{[1
]}

Valero, C. ^{[1
]}

机构：

[1] Univ Cadiz, Dept Stat & Operat Res, Cadiz, Spain

来源：

COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 07期

关键词：

Continuous location problem; Ordered median problem; Weizleld algorithm; l(p)-norms; CONVERGENCE; MODELS;

D O I：

10.1016/j.cor.2008.08.019

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents a procedure to solve the convex ordered median problem where the distances are measured with l(p)-norms. In order to do that, we consider an approximated problem and develop an algorithm based on a gradient descent method that generates a sequence with decreasing objective value. We prove its convergence to the optimal solution of the approximated problem. The paper ends with some computational results of the proposed methodology. (C) 2008 Elsevier Ltd. All rights reserved.

引用

页码：2250 / 2262

页数：13

共 31 条

[1]

[Anonymous], 1996, Die Grundlehren der mathematischen Wissenschaften

[2] Exact procedures for solving the discrete ordered median problem [J].