Geometric solution of a constrained rectilinear distance minimax location problem

Geometric solution of a constrained rectilinear distance minimax location problem

0.00 Avg rating0 Votes
Article ID: iaor19941695
Country: Singapore
Volume: 7
Issue: 2
Start Page Number: 163
End Page Number: 171
Publication Date: Nov 1990
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Abstract:

This paper considers a method for determining all the solutions of a two-dimensional constrained minimax location problem in which the distance measure is the L1- or rectilinear metric. The best possible location of the facility is to be obtained within a convex polyhedron. The algorithm presented here has a polynomial time complexity.

Reviews

Required fields are marked *. Your email address will not be published.