KNAPSACK Optimization Problem using Greedy Method Problem 1: Item Weight Value 1 14 20 2 6 16 3 10 8 4 5...

70.2K

Verified Solution

Question

Programming

KNAPSACK Optimization Problem using GreedyMethod
Problem 1:
Item Weight Value
1 14 20
2 6 16
3 10 8
4 5 10
5 4 12
Allowed weight = 24 Kg

Problem 2:
Item Weight Value
1 6 30
2 8 40
3 15 45
4 22 88
5 25 80
Allowed weight = 60 Kg

Problem 3:
Item Weight Value
1 6 30
2 8 40
3 15 45
4 22 88
5 25 80
Allowed weight = 60 Kg



Answer & Explanation Solved by verified expert
3.7 Ratings (658 Votes)
by using fractional method to solve the knapsack problrm using greedy approach Problem 1 Item Weight Value Value weight 1 14 20 2014 2 6 16 166 3 10 8 810 4 5 10 105 5 4 12 124 Allowed weight 24 Kg greedy to weight W24420V512 W20515V410 W1569V216 W990 V3910872    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students