Accession Number : AD0782746

Title :   A Weighted Round-Trip Location Problem.

Descriptive Note : Research rept.,

Corporate Author : FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING

Personal Author(s) : Chan,Albert W. ; Hearn,Donald W.

Report Date : JUN 1974

Pagination or Media Count : 30

Abstract : The problem considered is that of finding the location of a facility in the plane so that the maximum weighted rectilinear round-trip distance between the facility and N pairs of existing facilities is 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. An efficient solution procedure is developed for finding all the optimal locations to the problem. Two special cases are investigated, namely, when the existing facilities lie on a line, and when all the weights are equal. (Author)

Descriptors :   *LINEAR PROGRAMMING, INEQUALITIES, MATRICES(MATHEMATICS), MINIMAX TECHNIQUE, CONVEX SETS, MATHEMATICAL MODELS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE