Knapsack Problem with Vector Values
Yes, the decision problem is NP-complete.  If $n=1$ it is exactly the knapsack problem, which is already known to be NP-complete.

Possibly related Given a set of 2D vectors, find the furthest reachable point.