We consider the parametric Uncapacitated Facility Location Problem (UF
LP) where the demand of each customer is allowed to vary over a certai
n interval. Despite the value of parametric analysis, no such efforts
are found for the UFLP, that mainly seems to be due to the fact that p
arametric analysis usually requires the computation of a number of UFL
P's with heavy computational burden. In this paper, we will show that
the special structure of the UFLP provides a nice property for its par
ametric version, based on which an efficient branch and bound procedur
e for the parametric analysis is developed.