论文信息 - A Primal Simplex Based Solution Procedure for the Rectilinear Distance Multifacility Location Problem

A Primal Simplex Based Solution Procedure for the Rectilinear Distance Multifacility Location Problem

In this paper a primal simplex based solution procedure is developed for a multiproduct, multi-facility location problem using rectilinear distance measures. By overcoming the combinatorial nature of the problem which arises in the presence of degeneracy, this procedure is capable of handling large size problems. Computational results are also provided.

Hanif D. Sherali | C. M. Shetty

[1] Cabot A.Victor,et al. A Network Flow Solution to a Rectilinear Distance Facility Location Problem , 1970 .

[2] M. R. Rao,et al. On the Direct Search Approach to the Rectilinear Facilities Location Problem , 1973 .

[3] Henrik Juel,et al. An efficient computational procedure for solving the multi-facility rectilinear facilities location problem , 1976 .

[4] G. O. Wesolowsky,et al. Technical Note - The Optimal Location of New Facilities Using Rectangular Distances , 1971, Oper. Res..

[5] A. Alan B. Pritsker. A Note to Correct the Procedure of Pritsker and Ghare for Locating New Facilities with Respect to Existing Facilities , 1973 .

[6] Katta G. Murty,et al. Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..

[7] Robert F. Love,et al. An Application of a Facilities Location Model in the Prestressed Concrete Industry , 1976 .

[8] James G. Morris. A linear programming solution to the generalized rectangular distance weber problem , 1975 .

[9] John A. White,et al. On Solving Multifacility Location Problems using a Hyperboloid Approximation Procedure , 1973 .

[10] A. Pritsker,et al. Locating New Facilities with Respect to Existing Facilities , 1970 .