I am trying to understand what the difference is between the fractional knapsack problem using dynamic programming, and the greedy solution version. Im looking at an example of the fractional problem which looks like:What's the difference between that and the greedy solution? Are you not just taking the value-per-pound in this example too but it's just not explicitly stated?
Difference between fractional knapsack & greedy solution
algorithms;optimization;dynamic programming;greedy algorithms;knapsack problems