The minimum sphere covering a convex polyhedron
Authors:
- 1 December 1974
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 21 (4) , 715-718
Abstract
A finite algorithm is given for finding the smallest sphere enclosing a convex polyhedron in En described by a given system of linear equalities or inequalities. Extreme points of the polyhedron, and minimum spheres enclosing them, are generated in a systematic manner until the optimum is attained.Keywords
This publication has 6 references indexed in Scilit:
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972
- The Minimum Covering Sphere ProblemManagement Science, 1972
- Optimal location of a single service center of certain typesNaval Research Logistics Quarterly, 1971
- A Modified Linear Program for Columnar Methods in Mathematical ProgrammingOperations Research, 1971
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- Stationary points of quadratic maximum-problemsProbability Theory and Related Fields, 1965