Abstract
The single-facility location model with Euclidean distances and its multifacility and ℓp distance generalizations are considered. With present algorithms a user is unable to decide how close to optimal any given feasible solution is. This article describes two procedures for calculating a lower bound on the optimal objective function when a proposed solution is given.