0 votes 0 votes The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. P Q R S T U V W Weight 18 12 16 14 16 20 10 15 Profit 34 15 22 16 17 22 18 26 90 80.25 85.50 91.2 Algorithms algorithms greedy-algorithm knapsack-problem + – Parshu gate asked Nov 16, 2017 • edited Jun 24, 2022 by Arjun Parshu gate 8.3k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments vamp_vaibhav commented Nov 17, 2017 reply Follow Share Three complete and R in fraction 0 votes 0 votes vamp_vaibhav commented Nov 17, 2017 reply Follow Share Cross check Plz.. Is there any calculation mistake in mine 0 votes 0 votes saxena0612 commented Nov 17, 2017 reply Follow Share P Q R S T U V W 18 12 16 14 16 20 10 15 34 15 22 16 17 22 18 26 1.89 1.25 1.375 1.143 1.0625 1.10 1.80 1.733 SORTED BASED ON FRACTIONAL PROFIT SEQUENCE=P>>V>>W>>R>>Q>>S>>T 18*P = 34 10*V = 18 15*W = 26 7*R=1.375*7=9.625 TOTAL=87.625 2 votes 2 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes 87.625 neelesh bhakt answered Nov 17, 2017 • selected Dec 7, 2017 by Arpit Dhuriya neelesh bhakt comment Share Follow See all 0 reply Please log in or register to add a comment.