Question: Let S = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12, 4), b : (10, 6),
Let S = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12, 4), b : (10, 6), c : (8, 5), d: (11, 7), e: (14, 3), f : (7, 1), g : (9, 6). What is an optimal solution to the fractional knapsack problem for S assuming we have a sack that can hold objects with total weight 18? Show your work.
Step by Step Solution
3.45 Rating (168 Votes )
There are 3 Steps involved in it
In the shown below table the ith row jth column represents the solut... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
2036_61d6ac34260c6_835354.pdf
180 KBs PDF File
2036_61d6ac34260c6_835354.docx
120 KBs Word File
