Mathematical models for the variable weights version of the inverse minimax circle location problem

This paper deals with the case of variable weights of the inverse model of the minimax circle location problem. The goal of the classic minimax circle location problem is finding a circle in the plane such that the maximum weighted distance from a given set of existing points to the circumference of the circle is minimized.  In the corresponding inverse model, a circle is given and we should modify the weights of existing points with minimum cost, such that the given circle becomes optimal. The radius of the given circle can be fixed or variable. In this paper, both of these cases are investigated and mathematical models are presented for solving them.