The minimum sphere covering a convex polyhedron
Jack Elzinga, Donald W. Hearn · Naval Research Logistics Quarterly · 1974
Abstract A finite algorithm is given for finding the smallest sphere enclosing a convex polyhedron in E n 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.