Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem (Q1872031)

The authors analyze the sensitivity of the solution to the (distance measure) \(\ell_p\) Weber location problem to the value of \(p\) when \(p\) is in a certain range (and not necessarily the same for each demand point) by finding: (1) the set of possible optimal locations, (2) the location that minimizes the expected cost, and (3) the expected value of perfect information [see, e.g. their paper in Oper. Res. 28, 395--402 (1980; Zbl 0426.90021)]. Computational experiments are done for \(1.5\leq p\leq 2\).