Question: Question 1 (6 marks) Consider a 0-1 knapsack problem, where the knapsack has a capacity of 6 units and there are four items. Item 1

Question 1 (6 marks) Consider a 0-1 knapsack

Question 1 (6 marks) Consider a 0-1 knapsack problem, where the knapsack has a capacity of 6 units and there are four items. Item 1 has a size of 3 units and a value of 5 dollars, item 2 has a size of 5 units and a value of 8 dollars, item 3 has a size of 2 units and a value of 3 dollars, and item 4 has a size of 4 units and a value of 7 dollars. The objective is to decide which items shall be packed in the knapsack so as to maximise the total value of items in the knapsack. Its binary IP is shown as follows: max 2= s.t. 5x1 + 8x2 + 3x3 + 734 3x1 + 5x2 + 2x3 + 4x4

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 General Management Questions!

Question 1 [12 marks]: Consider the instance of discrete knapsack problem with the knapsack capacity 10 and the item information as follows: Item Weight Value 4 $1200 2 3 $6000 3 w $5100 $5400 Find...

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...

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...

Consider the 0-1 knapsack problem for items 1,2,3,4,5, whose values are [4, 3, 6, 5, 7] and whose weights are [2, 2, 3, 4, 5]. Assume the knapsack capacity is 10. Apply the knapsack algorithm in the...

3. Dynamic programming. Consider the 0-1 knapsack problem. You have a knapsack with total capacity W, and n distinct items with values V, V2, ..., Un and weights w, W2, ..., Wn. You can either choose...

Q5. Consider a 0-1 Knapsack Problem where we have four items with weights (in Kg) [1, 5, 3, 4] and corresponding values (in euro) [15, 10, 9, 5]. The Knapsack capacity is K 8 Kg. Using the notation...

1) (18 pts.) (i) Consider the following variation of the 0/1 Knapsack problem: Given are a knapsack of capacity W and n items, with each item having a profit pi, a weight w, and a type ti, 1 SiSn....

This exercise is to gain an hands - on understanding of implementing a Dynamic Programming algorithm from the recursive formulation. Consider the 0 / 1 Knapsack problem and the recursive formulation...

Consider the fractional knapsack problem with 10 items. The gain and weight of each item is shown in the table below. The total capacity of the knapsack is 150 a) Find the optimal selection of items...

Question 1 (8 marks) Consider each of the following situations: A.One of the mitigating controls that you wish to rely on is that any increases in credit limits are authorised by the financial...

What techniques from this chapter can you adapt to manage your personal brand and reputation? List at least six tactics you might use, and why.

Review the financial statements and related notes of the Coca-Cola Company in Appendix A. Required Answer the following questions. Indicate on what page of the annual report you located the answer....

Since 2 0 1 0 , the number of business filings for bankruptcy has steadily increased each year. True False

Listed below are paired data consisting of movie budget amounts and the amounts that the movies grossed. Find the regression equation, letting the budget be the predictor (x) variable. Find the best...