Abstract
This paper introduces interactive computer graphical optimization to location analysis. An interactive graphical program is described for solving single-facility minimax location problems with nonconvex feasible regions. The core of the program is a well-defined algorithm with a simple, human-executed pattern recognition task as one of its steps. Globally optimal solutions are assured under very mild assumptions on human performance, and the program is reasonably fast.