Farthest Distance Function to Strongly Convex Sets

The aim of the present paper is twofold. On one hand, we show that the strong convexity of a set is equivalent to the semiconcavity of its associated farthest distance function. On the other hand, we establish that the farthest distance of a point from a strongly convex set is the minimum of farthest distances of the given point from suitable closed balls separating the set and the point. Various other results on strongly convex sets are also provided.