An optimal algorithm for solving constrained minimax location problems has been previously reported, with the major limitation that only a single new service facility is allowed. Algorithmic extensions have now been developed and implemented on an advanced color-graphics system for the location of any number of new facilities to collectively serve the set of existing facilities. The minimax criterion is again considered for the optimization, and nonconvex constraint sets are permitted.