A Minimax Lattice Point Location Problem
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
The problem is considered of assigning n facilities, or departments, to locations so that the maximum of the rectilinear distances between departments is minimized. The locations are considered to be points in a lattice. A simple expression is developed for the minumum value of the objective function for all values of n the expression has as a corollary a necessary and sufficient condition for an assignment, or a configuration, to be minimax also a simple geometrical procedure is developed for constructing minimax configurations. A closed form solution is obtained for an analogous continuous problem.
- Operations Research