MINIMAX MULTIFACILITY LOCATION WITH EUCLIDEAN DISTANCES

The problem considered is that of locating N new facilities among M existing facilities with the objective of minimizing the maximum weighed Euclidean distance among all facilities. The application of nonlinear duality theory shows this problem can always be solved by maximizing a continuously differentiable concave objective subject to a small number of linear constraints. This leads to a solution procedure which produces good numerical results. Computational experience is reported.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  USA  21202
  • Authors:
    • Elzinga, J
    • Hearn, D
    • Randolph, W D
  • Publication Date: 1976-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00159681
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: May 31 1978 12:00AM