Sensitivity analysis to the value of p of the lp distance Weber problem

In this paper we analyze the sensitivity of the lp distance Weber problem to the value of p. We consider each power p to be in a range and not necessarily the same for each demand point. We find the set of possible optimal locations when p is in a given range. We also find the location that minimizes the expected cost, and find the Expected Value of Perfect Information. Computational results are presented.