For a set of n points with corresponding positive weights and as set of all k- dimensional planes in Euclidean vector space , with and , it is shown that the location problem minimize , is at least as difficult as the known FERMAT-TORRICELLI-PROBLEM in . Further, known results on this FERMAT-TORRICELLI-PROBLEM and on the case are summarized.
