Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Duality in the Cent-Dian of a Graph

Jonathan Halpern
Operations Research
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
  • Download ($30.00)
  • Cite this Item
Duality in the Cent-Dian of a Graph
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
722
    722
  • Thumbnail: Page 
723
    723
  • Thumbnail: Page 
724
    724
  • Thumbnail: Page 
725
    725
  • Thumbnail: Page 
726
    726
  • Thumbnail: Page 
727
    727
  • Thumbnail: Page 
728
    728
  • Thumbnail: Page 
729
    729
  • Thumbnail: Page 
730
    730
  • Thumbnail: Page 
731
    731
  • Thumbnail: Page 
732
    732
  • Thumbnail: Page 
733
    733
  • Thumbnail: Page 
734
    734
  • Thumbnail: Page 
735
    735