We state the problem of separating two finite point sets in
by means of a given number of ellipsoids. The problem reduces to the solution of a mathematical program with a nonconvex, nonsmooth objective function of the sum-min type. We discuss two algorithms to tackle the problem and present numerical results on several testing datasets.