We are greedy on taking the maximum profit density to solve the

We are greedy on taking the maximum profit density to solve the fractional version of the knapsack problem, if $$x_{i}$$ is the percentage of the item $$i (1\le i\le n)$$ being packed, then at most one of the $$x_{i}'s$$ is fractional. ~@[](1)

答案：TRUE