FACILITY LOCATION WITH AND WITHOUT MAXIMUM DISTANCE CONSTRAINTS THROUGH THE P-MEDIAN PROBLEM

The p-median problem involves the locating of a fixed number of facili ties to serve a set of customers such that the aggregate distance trav elled is minimized. Considers the p-median problem with and without di stance constraints. Solves the two versions of the p-median problems u tilizing the heuristic proposed by Teitz and Bart using three differen t data sets. Also provides optimal solutions to these problems using t he Lagrangian relaxation and subgradient methods in the branch-and-bou nd procedure. Shows that the heuristic performs quite well except for the cases where the constraints are tight (few facilities and/or small maximum distance).