You are not currently logged in.
Access JSTOR through your library or other institution:
Duality in the Cent-Dian of a Graph
Vol. 28, No. 3, Part 2 (May - Jun., 1980), pp. 722-735
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/170038
Page Count: 14
You can always find the topics here!Topics: Vertices, Statistical median, Objective functions, Line segments, Rectangles, Optimal solutions, Linear transformations, Fall lines, Local minimum, Mathematical functions
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Operations Research © 1980 INFORMS