V magistrskem delu bo predstavljen problem iskanja točke, od katere je vsota razdalj do preostalih končno mnogo točk v evklidski ravnini minimalna. Narejen bo zgodovinski pregled reševanja danega problema. Problem bo razširjen z dodajanjem uteži na posamezno povezavo in iskanjem optimalne lokaije točke, od katere je vsota razdalj do vseh točk minimalna. Predstavljen bo numerični postopek za iskanje rešitve razširjenega problema. Izdelana bo aplikaija, s katero bo moč grafično prikazati in analizirati dani problem. Rešitev takega problema lahko služi kot izhodišče za iskanje logističnega centra pri na primer tovornem prometu, poštnih storitvah in podobno. In the master thesis the problem of finding the point from which the sum of all the distances to any number of points in the Euclidean plane is minimal, will be presented. A historical overview of solving the given problem will be made. The given problem will be expanded by adding weights to the individual connections and finding the optimal location for the point mentioned above. A numerical method for finding a solution to the expended problem will be presented. An application, which allows a graphic display and analysis of the given problem, will be made. A solution for such a problem can act as the starting point in search of the logistics center for freight transport or postal services, and the like.
