To which of the following domain problem does the knapsack problem belong?

Correct Answer: Option C

Explanation: knapsack algorithm is used to find the maximum profit out of the least weight combination possible, therefore it definitely belongs to an optimization domain.