I am not able to search for algorithms which can help me solve this problem, I am not sure under which category this problem falls or which algorithm to use.
There are N number of suppliers who supply Sugar, each supplier has Supplier Location (latitude, longitude) of their warehouse from which they will supply and they also have a 'maximum_radius' to which they can supply.
Now, if a user comes and gives his location User Location (latitude, longitude), how do I find who all suppliers can supply to that place.
The only solution I can think if go to each Supplier Location, calculate the distance to User Location, and check if it falls within maximum_radius of the supplier. But this seems slow, as the number of suppliers will increase over time.