Optimum Location Probabilities in thelpDistance Weber Problem Academic Article uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • Identity
  •  
  • Additional Document Info
  •  
  • View All
  •  

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 lp case.

publication date

  • May 1981