The Minimum Covering Sphere Problem

D. Jack Elzinga and Donald W. Hearn
Additional contact information
D. Jack Elzinga: The Johns Hopkins University
Donald W. Hearn: University of Florida

Management Science, 1972, vol. 19, issue 1, 96-104

Abstract: The minimum covering sphere problem, with applications in location theory, is that of finding the sphere of smallest radius which encloses a set of points in E n . For a finite set of points, it is shown that the Wolfe dual is equivalent to a particular quadratic programming problem and that converse duality holds. A finite decomposition algorithm, based on the Simplex method of quadratic programming, is developed for which computer storage requirements are independent of the number of points and computing time is approximately linear in the number of points.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.1.96 (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:ormnsc:v:19:y:1972:i:1:p:96-104

Access Statistics for this article

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