Given a set of points and a line as ax$+$by$+$c $=0.$ Describe an algorithm to find a point

on the given line for which the sum of distances from the given set of points is minimum