Duality in the Cent-Dian of a Graph

Jonathan Halpern
Additional contact information
Jonathan Halpern: University of Calgary, Calgary, Canada, and Technion, Israel

Operations Research, 1980, vol. 28, issue 3-part-ii, 722-735

Abstract: Almost all facility location models seek to minimize either the average distance traveled by all customers to the facility (the median problem), or the distance of the furthest customer from the facility (the center problem). In practice the two objectives are usually antagonistic and yet in many cases both criteria are important (called the cent-dian problem). For such cases the paper presents two possible approaches to model formulation. First is to minimize a function which is a (convex) combination of the furthest (center) and the average (median) objective functions. Second is to minimize one of the criteria, subject to an upper bound on the value of the other criterion. For facility location on a network, it is shown that the first approach is a special case of the second. Furthermore, the two different constrained problems, which exist under the second approach, are dual problems in a well defined sense. Finally the paper provides several features of the tradeoff between the two criteria.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.722 (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:28:y:1980:i:3-part-ii:p:722-735

Access Statistics for this article

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