The Minimum Covering Sphere Problem
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<sup>n</sup>. 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.
Year of publication: |
1972
|
---|---|
Authors: | Elzinga, D. Jack ; Hearn, Donald W. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 19.1972, 1, p. 96-104
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
The solution of an optimal control problem in financial modeling
Davis, Blaine Eugene, (1971)
-
Business process engineering : advancing the state of the art
Elzinga, D. Jack, (1999)
-
Business Process Engineering : Advancing the State of the Art
Elzinga, D. Jack, (1999)
- More ...