Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem

Graciano Sá
Additional contact information
Graciano Sá: Institute of Applied Economic Research, Rio de Janeiro, Brazil

Operations Research, 1969, vol. 17, issue 6, 1005-1016

Abstract: In the capacitated plant-location problem, a planner is given a set of projects for production expansion and a linear transportation-cost matrix, and is asked to choose the subset of projects that meets demand at several markets, at the least production-distribution cost. The projects are defined a priori by size, location, and cost function, the latter being concave. An exact branch-and-bound treatment for the problem is explained, together with an approximate routine for solving the problem. The approximate routine borrows from the “add” approach of Kuehn-Hamburger and the “drop” approach of Feldman-Lehrer-Ray. Some of its mathematical properties are described, and sufficient conditions for the optimality of the solution obtained are shown. Empirical evidence is provided suggesting that the branch-and-bound method may be useful in problems of around 25 integer variables, perhaps more, depending on how tightly row-constrained the problem at hand is. Evidence is also provided suggesting that the approximate routine is fast and produces good, frequently optimal, results.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.6.1005 (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:17:y:1969:i:6:p:1005-1016

Access Statistics for this article

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