An efficient algorithm based on discrete monotonic optimization is proposed for finding the largest ball centered in a given $\underline{\text{finite}}$ $S\subset \mathbb R^n$ and disjoint from any of $m$ given balls in $\mathbb R^n$.