Fuzzy versions of the covering circle problem

In this paper we consider two fuzzy versions of the well-known problem of determining the smallest circle (center and radius) that would cover a given finite set of points in the plane when the locations of points are not precise but fuzzy. The first is modeled as a possibility-constrained mathematical program while the second is modeled as a necessity-constrained one. Polynomial algorithms are presented for both the versions. Also, a numerical example is included for one case. These models and solutions are of interest in both theoretical and practical contexts.