next up previous
Next: Fractional Knapsack Problem exhibits Up: CSE 2320: Algorithms and Previous: Question:

The Fractional Knapsack Problem exhibits Optimal Substructure

Proof Sketch: Consider the most valuable load weighing W. If we remove weight w of item i from the loot, then the remaining load must contain the optimal selection of the other n-1 items and the wi - w pounds of item i. If not, then the original load was not the most valuable.

Copyright © 1998 The University of Texas at Arlington