Understanding and Using Linear Programming XI: The KKT Conditions and the Unique Smallest Enclosing BallTextbook
The smallest enclosing ball problem asks, for finitely many points , for a ball of the smallest radius that contains all of them. It appears in clustering, in collision detection and bounding-volume hierarchies, in facility location (placing one service point so that the farthest client is as close as possible), and in the…