Maximin location problem with rectilinear distance objective and general form of constraints

Abstract

This thesis deals with the Maximin location problem in which new facility must be placed so that the shortest weighted rectilinear distance to nexisting points is as large as possible and at the same time the facility must be placed within a pre-specified distance from each point. Two kinds of problem are formulated depending on how the distance is measured in constraints, rectilinear and Euclidean. Algorithms, one based on Linear Programming and the other through three-dimensional analysis are developed for each problem.