Abstarct: In this thesis we consider the line location problem. Let P=(V,E) be a path with n vertices. We want to fine the location of facilities on this path. We consider the two types of line location problem. In this second chapter we pay attention to median mean problem, witch goal is minimizing the mean distance between vertices and facilities. In the thiered chapter we consider a polynomial algorithm for median line location problem. In this median location we want to minimize the sum of distances from facilities to all vertices.