
The inverse minisum circle location problem
Author(s) -
Mehraneh Gholami,
Jafar Fathali
Publication year - 2022
Publication title -
yugoslav journal of operations research/yugoslav journal of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.221
H-Index - 21
eISSN - 2334-6043
pISSN - 0354-0243
DOI - 10.2298/yjor200715027g
Subject(s) - mathematics , circumference , inverse , plane (geometry) , radius , inverse problem , mathematical optimization , combinatorics , mathematical analysis , geometry , computer science , computer security
Let n weighted points be given in the plane. The inverse version of the minisum circle location problem deals with modifying the weights of points with minimum cost, such that the sum of the weighted distances from the circumference of a given circle C with radius r, to the given points is minimized. The classical model of this problem contains infinite constraints. In this paper, a mathematical model with finite constraints is presented. Then an efficient method is developed for solving this problem.