Interactive Computer Graphical Solutions of Constrained Minimax Location Problems
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An interactive graphical program is described for solving single-facility minimax location problems with nonconvex feasible regions with Globally optimal solutions under very mild assumptions on human performance, and the program is reasonably fast.
Abstract
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.
