Technical Note—On the Equivalence of Dual Methods for Two Location Problems

Ning Xu and Timothy J. Lowe
Additional contact information
Ning Xu: College of Business Administration, University of Iowa, Iowa City, Iowa 52240
Timothy J. Lowe: College of Business Administration, University of Iowa, Iowa City, Iowa 52240

Transportation Science, 1993, vol. 27, issue 2, 194-199

Abstract: Separate algorithms have been reported in the literature to find dual solutions to the linear programming relaxations of the simple plant location problem, and the location covering problem. We explore the connection between these two algorithms.

Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.27.2.194 (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:ortrsc:v:27:y:1993:i:2:p:194-199

Access Statistics for this article

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