Question: Question 2 [10 marks]: Consider the instance of discrete knapsack problem with the knapsack capacity 40 and the item information as follows: Item Weight Value

Question 2 [10 marks]:

Consider the instance of discrete knapsack problem with the knapsack capacity 40 and the item information as follows:

Item Weight Value

A 30 $1800

B 20 $1160

C 20 $1160

D 8 $360

Find the most valuable subset of the items that fits into the knapsack using Greedy Approach. Is the resulting solution the optimal solution? Verify informally and give the reason to justify of your answer.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Question 1 [10 marks]: Consider the instance of continuous knapsack problem with the knapsack capacity 150 and the item information as follows: Item Weight Value 1 70 $420 2 30 $120 3 40 $400 4 50...

pass me answer in digital text form, thank you. Q2 Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: Item 1 2 3 4 Weight 15 10 10 4...

Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: Item 1 2 3 4 Weight 15 10 10 4 Value $900 $580 $580 $180 Find the most valuable...

bmit one pdf file to answer each question. Q2 Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: on Item 1 2 3 4 Weight 15 10 10 4....

Consider the instance of discrete knapsack problem with the knapsack capacity 8 0 0 and the item information as follows: Item Weight Value 1 6 0 0 $ 3 6 , 0 0 0 2 4 0 0 $ 2 3 , 2 0 0 3 4 0 0 $ 2 3 ,...

Question 3 ( 2 0 marks ) There are n items and a "knapsack". Each item i has weight w i > 0 and has value v i 0 . Knapsack has capacity of W ? . The goal is to fill knapsack so as to maximize total...

The following is an instance of the knapsack problem. The capacity is 10. item weight value 1. 1 20 2 2 30 3 3 66 4 4 40 5 5 58 3.1 Use the dynamic programming algorithm to solve the above knapsack...

Answer all Questions This individual project is worth 60% of your final grade. The assignment is due on May 15th, 2020. Question 1 (30 Marks) The concept of budgeting has been a long established...

Help me please. In the month of September, all of the walmart grocery stores in Virginia sold 429,382 eggs. In that same month, all of the walmart grocery stores in Texas sold 283,054 eggs. How many...

What kind of culture do Turkish have?

Write a report in which you research, identify and explain the functionality of emergency support function 13. Identify the following in your report: the origin of esf-13 the scope of esf-13...

intra - state supply refers to _ _ _ _ a . location of supplier and place of supply in same state b . location of recipient and place of supply in same state c . location of supplier and place of...

please dont use chat gpt a . 7 6 9 . Clausius - Clapeyron

Why is the System Build Process an iterative process?

What phase normally comes directly after the System Build process in a Project?

Name two other algorithms available in SSAS Data Mining other than Decision Trees.