I want to know if this problem is polynomial-time solvable or not? The problem is: Given a nonnegative integer-valued matrix of size $2\times n$ and two nonnegative integer numbers $b\leq n$ and $c$. The question is: Find a subset of the columns of cardinality at most $b$ such that the sum of ...