Fuzzy disk for covering fuzzy points

In this paper, we consider an important fuzzy version of the well known smallest covering circle problem which is also called the Euclidean 1-center problem. Here we are given a set of points in the plane whose locations are crisp. However, the requirement for coverage of each point is fuzzy as represented by its grade of membership. As such we qualify the points as fuzzy. In the above framework, we wish to find a fuzzy disk with minimum fuzzy area for covering the given fuzzy points. After developing a general model, certain special cases are investigated in detail. Polynomial algorithms are presented for the special cases. [PUBLICATION ABSTRACT]