Optimal Facility Location with Concave Costs

Richard M. Soland
Additional contact information
Richard M. Soland: The University of Texas at Austin, Austin, Texas

Operations Research, 1974, vol. 22, issue 2, 373-382

Abstract: The following problem is considered: select plant sites from a given set of sites and choose their production and distribution levels to meet known demand at discrete points at minimum cost. The construction and operating cost of each plant is assumed to be a concave function of the total production at that plant, and the distribution cost between each plant and demand point is assumed to be a concave function of the amount shipped. There may be capacity restrictions on the plants. A branch-and-bound algorithm for identifying an optimal solution is described; it is equivalent to the solution of a finite sequence of transportation problems. The algorithm is developed as a particular case of a simplified algorithm for minimizing separable concave functions over linear polyhedra. Computational results are cited for a computer code implementing the algorithm.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.2.373 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:22:y:1974:i:2:p:373-382

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().