A linear programming solution to the generalized rectangular distance weber problem

James G. Morris

Naval Research Logistics Quarterly, 1975, vol. 22, issue 1, 155-164

Abstract: The Weber Problem generalized to the location of several new points with respect to existing points is formulated as a linear programming problem under the assumption that distances are rectangular. The dual problem is then formulated and subsequently reduced to a problem with substantially fewer variables and constraints than required by an existent alternative linear programming formulation. Flows may exist between new as well as between new and existing points. Linear constraints can be imposed to restrict the location of new points. Pairwise constraints limiting distances between new points and between new and existing points can also be accommodated.

Date: 1975
References: Add references at CitEc
Citations:

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

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:22:y:1975:i:1:p:155-164

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 ().