A Dual-Based Procedure for Uncapacitated Facility Location

Donald Erlenkotter
Additional contact information
Donald Erlenkotter: University of California, Los Angeles, California

Operations Research, 1978, vol. 26, issue 6, 992-1009

Abstract: We develop and test a method for the uncapacitated facility location problem that is based on a linear programming dual formation. A simple ascent and adjustment procedure frequently produces optimal dual solutions, which in turn often correspond directly to optimal integer primal solutions. If not, a branch-and-bound procedure completes the solution process. This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required. Computational tests on problems with as many as 100 potential facility locations provide evidence that this approach is superior to several other methods.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (99)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.6.992 (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:26:y:1978:i:6:p:992-1009

Access Statistics for this article

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