Computer Science, asked by sandynikki, 11 months ago


consider the following instance of knapsack
problem with poot ito = 415,12,9,16,17'), weights
{ 2,523, 4,6] and w=12. find the value of maximam
profit with the
optimal solotion
fraclonal knapsack problems

Answers

Answered by SugaryCherrie
1

ow do you find the optimal solution for a knapsack problem?

Weight = {2, 3, 5, 7, 1, 4, 1}

To prove: Optimal solution that gives maximum profit.

Proof:

Step 1: (To find profit/ weight ratio)

Step 2: (Arrange this profit/weight ratio in non-increasing order as n values) Since the highest profit/weight ratio is 6. ...

Answered by ʙᴇᴀᴜᴛʏᴀɴɢᴇʟ
4

Explanation:

Weight = {2, 3, 5, 7, 1, 4, 1}

To prove: Optimal solution that gives maximum profit.

Proof:

Step 1: (To find profit/ weight ratio)

Step 2: (Arrange this profit/weight ratio in non-increasing order as n values) Since the highest profit/weight ratio is 6. ...

Order = (5, 1, 6, 3, 7, 2, 4)

Similar questions