A Solution Procedure for a Rectilinear Distance Minimax Round Trip Location Problem.

Abstract

The problem considered is that of finding the location of a facility in the plane so that the maximum rectilinear round trip distance between the facility and N pairs of existing facilities in the plane will be minimized. The round trip distance is the total distance travelled starting from the new facility via a pair of existing facilities and back to the new facility. A solution procedure is developed for finding all optimal locations to the problem. The derivation of the procedure is based on solving a linear program which is equivalent to the minimax location problem in question. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1973
Accession Number
AD0759128

Entities

People

  • Albert W. Chan
  • Donald W. Hearn

Organizations

  • University of Florida

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Applied Mathematics
  • Buildings And Structures
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Aviation Safety and Air Traffic Management
  • Geodesy