Solve fractional knapsack problem for the following: n=6, p=(18, 5, 9, 10, 12, 7), w=(7, 2, 3, 5, 3, 2), maximum sack capacity M=13

Fractional Knapsack Problem

There are various methods are used to solve the Fractional Knapsack Problem such as follows:

• Select the item based on the Maximum Profit.
• Select the item based on the Minimum Weight.
• Calculate the Ratio of Profit/Weight (Greedy Approach).

Here, we used the Ratio of Profit/Weight (Greedy Approach) …