Article ID: | iaor20031781 |
Country: | United States |
Volume: | 50 |
Issue: | 4 |
Start Page Number: | 670 |
End Page Number: | 679 |
Publication Date: | Jul 2002 |
Journal: | Operations Research |
Authors: | Klamroth Kathrin, Wiecek Margaret M. |
The multiple objective median problem (MOMP) involves locating a new facility with respect to a given set of existing facilities so that a vector of performance criteria is optimized. A variation of this problem is obtained if the existing facilities are situated on two sides of a linear barrier. Such barriers, like rivers, highways, borders, or mountain ranges, are frequently encountered in practice. In this paper, theory of an MOMP with line barriers is developed. As this problem is nonconvex but specially structured, a reduction to a series of convex optimization problems is proposed. The general results lead to a polynomial algorithm for finding the set of efficient solutions. The algorithm is proposed for bicriteria problems with different measures of distance.