this was left unanswered for 1 week on MStackExchange, so I thought MOverflow would be more appropriate. Thanks :)
Let $R = (R_x, R_y, R_z)$ be the resultant vector of the n vectors and $M = (M_x, M_y, M_z)$ is a given vector.
Select n vectors from $k$ vectors such that: $R_x ≥ M_x , R_y ≥ M_y,$ and $R_z ≥ M_z$.
I am in search of an efficient algorithm/method (something faster than $k^5$, for n = 5) that finds any valid set of n vectors.