A Maxmin Location Problem

B. Dasarathy and Lee J. White
Additional contact information
B. Dasarathy: GTE Laboratories Incorporated, Waltham, Massachusetts
Lee J. White: The Ohio State University, Columbus, Ohio

Operations Research, 1980, vol. 28, issue 6, 1385-1401

Abstract: The problem considered is to locate a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of points. The paper describes several possible application areas and shows the existence of a finite set of candidates for the optimal solution. A combinatorial algorithm is presented for the problem in three dimensions, and it is compared with existing nonconvex programming algorithms.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.6.1385 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:6:p:1385-1401

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().