On Solving Multifacility Location Problems using a Hyperboloid Approximation Procedure

1 March 1973

journal article
research article
Published by Taylor & Francis in A I I E Transactions

Vol. 5 (1) , 01-06
https://doi.org/10.1080/05695557308974875

Abstract

An iterative solution method is presented for solving multifacility location problems involving rectilinear and/or Euclidean distances. The iterative procedure is based on the use of an approximating function involving hyperboloids, which in the limit approach the cones in the original objective function. Given that the hyperboloid approximation procedure converges, it is shown to converge to the optimum solution. Computational experience with the procedure is described.

Keywords

This publication has 12 references indexed in Scilit:

Locating New Facilities with Respect to Existing Facilities
A I I E Transactions, 1970
A Network Flow Solution to a Rectilinear Distance Facility Location Problem
A I I E Transactions, 1970
Locating facilities in three‐dimensional space by convex programming
Naval Research Logistics Quarterly, 1969
On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
SIAM Journal on Applied Mathematics, 1969
SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS†
Journal of Regional Science, 1967
An Algorithm and Computational Procedure for Locating Economic Facilities
Management Science, 1967
Heuristic Methods for Location-Allocation Problems
SIAM Review, 1964
Location-Allocation Problems
Operations Research, 1963
AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS
Journal of Regional Science, 1962
Link-Length Minimization in Networks
Operations Research, 1958