Let B_i, i = 1, . . . ,m, be m given Euclidean balls in Rⁿ, with centers x_i, and radii ρ_i ≥ 0. We wish to find a ball B of minimum radius that contains all the Bi, i = 1, . . . ,m. Explain how to cast this problem into a known convex optimization format.