MINISUM IP DISTANCE LOCATION-PROBLEMS SOLVED VIA A PERTURBED PROBLEM AND WEISZFELDS ALGORITHM

被引:36
作者
MORRIS, JG [1 ]
VERDINI, WA [1 ]
机构
[1] ARIZONA STATE UNIV,TEMPE,AZ 85281
关键词
D O I
10.1287/opre.27.6.1180
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The classical iterative algorithm originally proposed by E. Weiszfeld for solving minimum facility location problems is generalized to the case of I//p distances. A differentiable approximating function is used to replace the original nondifferentiable convex objective function. The approximating function is shown to be uniformly convergent to the original objective function as a smoothing constant approaches zero. Characterizations and convergence properties peculiar to the algorithm are discussed, and computational experience is presented. The straightforward extension to multifacility location problems is also developed.
引用
收藏
页码:1180 / 1188
页数:9
相关论文
共 19 条
[1]   LOCATION-ALLOCATION PROBLEMS [J].
COOPER, L .
OPERATIONS RESEARCH, 1963, 11 (03) :331-343
[2]   SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS [J].
COOPER, L .
JOURNAL OF REGIONAL SCIENCE, 1967, 7 (01) :1-18
[3]  
EYSTER JW, 1973, AIIE T, V5, P1
[4]   PROPERTIES OF A MULTIFACILITY LOCATION PROBLEM INVOLVING EUCLIDEAN DISTANCES [J].
FRANCIS, RL ;
CABOT, AV .
NAVAL RESEARCH LOGISTICS, 1972, 19 (02) :335-353
[5]  
Jacoby S.L.S., 1977, ITERATIVE METHODS NO
[6]  
Katz I. N., 1974, Mathematical Programming, V6, P89, DOI 10.1007/BF01580224
[8]  
KUHN HW, 1962, J REGIONAL SCI, V4, P21
[9]  
Kuhn HW, 1973, MATH PROGRAM, V4, P98, DOI [10.1007/BF01584648, DOI 10.1007/BF01584648]
[10]   SOLVING CONSTRAINED MULTI-FACILITY LOCATION PROBLEMS INVOLVING LP DISTANCES USING CONVEX PROGRAMMING [J].
LOVE, RF ;
MORRIS, JG .
OPERATIONS RESEARCH, 1975, 23 (03) :581-587