A primal simplex algorithm to solve a rectilinear distance facility location problem

Ronald D. Armstrong

Naval Research Logistics Quarterly, 1977, vol. 24, issue 4, 619-625

Abstract: This paper considers the problem of locating m new facilities in the plane so as to minimize a weighted rectangular distance between the new facilities and n existing facilities. A special purpose primal simplex algorithm is developed to solve this problem. The algorithm will maintain at all times a basis of dimension m by m; however, because of the triangularity of the basis matrix, it will not be necessary to form a basis inverse explicitly.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800240409

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:wly:navlog:v:24:y:1977:i:4:p:619-625

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().