In a supermarket there are 7 different products in different packages. The weights and values of...

Transcribed Image Text:

In a supermarket there are 7 different products in different packages. The weights and values of packages are as follows: Package 1 2 3 4 5 6 Weights (kg) 10 187935m Values (5) 100 130 200 120 150 110 40 A thief breaks into this supermarket and she cannot carry weight exceeding 30 kg. Can you suggest a way to the thief to collect the most valuable items with the lowest weights, and what should be the list of items in her knapsack? [30 pts] In a supermarket there are 7 different products in different packages. The weights and values of packages are as follows: Package 1 2 3 4 5 6 Weights (kg) 10 187935m Values (5) 100 130 200 120 150 110 40 A thief breaks into this supermarket and she cannot carry weight exceeding 30 kg. Can you suggest a way to the thief to collect the most valuable items with the lowest weights, and what should be the list of items in her knapsack? [30 pts]

Answer rating: 100% (QA)

To solve this problem we can use the Knapsack Problem which is a classic optimization problem in com... View the full answer