A Bi-Objective Median Location Problem With a Line Barrier

Kathrin Klamroth and Margaret M. Wiecek ()
Additional contact information
Kathrin Klamroth: Institute of Applied Mathematics, University of Erlangen-Nuremberg, Erlangen, Germany
Margaret M. Wiecek: University of Copenhagen, Copenhagen, Denmark, and Department of Mathematical Sciences, Clemson University, Clemson, South Carolina

Operations Research, 2002, vol. 50, issue 4, 670-679

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.

Keywords: Facilities/equipment planning; location; continuous: location with a barrier and multiple criteria. Programming; multiple criteria: location with a barrier (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.50.4.670.2857 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:50:y:2002:i:4:p:670-679

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().