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:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Corporate Authors:

  Operations Research Society of America

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

Media Info

• Features: References;
• Pagination: p. 321-336
• Serial:
  • Transportation Science
  • Volume: 10
  • Issue Number: 4
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Distance; Euclidean spaces; Facilities; Location; Mathematical methods; Mathematical models; Nonlinear systems; Operations research; Traffic flow; Transportation; Urban transportation
• Uncontrolled Terms: Nonlinearity
• Old TRIS Terms: Linearization
• Subject Areas: Administration and Management; Operations and Traffic Management; Planning and Forecasting; Transportation (General);

Filing Info

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