Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1287/opre.50.4.670.2857 | Operations Research |
Keywords | Field | DocType |
convex optimization problem,general result,median location problem,polynomial algorithm,different measure,existing facility,bicriteria problem,line barrier,multiple objective median problem,linear barrier,efficient solution,location | Situated,Mathematical optimization,Polynomial algorithm,Convex optimization,1-center problem,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
50 | 4 | 0030-364X |
Citations | PageRank | References |
6 | 0.53 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kathrin Klamroth | 1 | 579 | 41.93 |
| Margaret M. Wiecek | 2 | 213 | 22.90 |