Optimum Location Probabilities in the l p Distance Weber Problem

Z. Drezner and G. O. Wesolowsky
Additional contact information
Z. Drezner: University of Michigan, Dearborn, Michigan
G. O. Wesolowsky: McMaster University, Hamilton, Ontario

Transportation Science, 1981, vol. 15, issue 2, 85-97

Abstract: In this paper it is assumed that the weights which summarize cost and volume parameters in the Weber problem are known only probabilistically. In general, the object is to find the probability that the facility will be optimally located at any given point or in any region. We assume that the weights have a truncated (no negative values) multivariate normal distribution with known means, variances and covariances. An efficient computational procedure is given in the p = 1 case (rectangular distances) for finding the desired probabilities approximately. An efficient method is also given for finding the approximate probability that a facility will be optimally located at any given demand point in the general l p case.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.15.2.85 (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:15:y:1981:i:2:p:85-97

Access Statistics for this article

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