Accession Number:

AD0735349

Title:

A Minimax Lattice Point Location Problem

Descriptive Note:

Technical rept.

Corporate Author:

FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING

Personal Author(s):

Report Date:

1971-11-01

Pagination or Media Count:

26.0

Abstract:

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE