Algorithm to position a circle within an area with Restricted Area Polygon and with certain distance of Target Polygons

Question

I'm having difficulties coming up with an algorithm for the following problem.

I need to place a circle with radius R (give it latlon coordinates).

Goal:

• There are "Target Polygons", each with a "min distance" parameter. The distance from the center of the circle to the farthest point in the polygon must not be greater than "min distance + R"

Restrictions:

• The circle must not overlap with polygons ("Restricted Areas")

I've tried formulating it as a MILP problem or CSP problem, without success. Any help would be greatly appreciated!