Exact solution methods for uncapacitated location problems with convex transportation costs

In this paper we study exact solution methods for uncapacitated facility location problems where the transportation costs are nonlinear and convex. An exact linearization of the costs is made, enabling the formulation of the problem as an extended, linear pure zero-one location model. A branch-and-bound method based on a dual ascent and adjustment procedure is developed, and compared to application of a modified Benders decomposition method. The specific application studied is the simple plant location problem (SPLP) with spatial interaction, which is a model suitable for location of public facilities. Previously approximate solution methods have been used for this problem, while we in this paper investigate exact solution methods. Computational results are presented. (C) 1999 Elsevier Science B.V. All rights reserved.