On the complexity of the maximum sum length vectors subset choice problem

The maximum sum length vectors subset choice problem is considered. In the case of the fixed dimension of the space this problem is polynomially solvable. It is proved that the problem is NP-hard if the dimension of the space is a part of input. Bibl. 6.