1. Consider an instance of the Knapsack Problem without repetitions with 4 items, having weights and values as follows. The weights (in pounds) are w1=2, w2 =7, w3 =10, w4 =12. The dollar values of these items are respectively v1 = 12, v2 = 28, v3 = 30, v4 = 5. The capacity of the knapsack is 12. (a) Find the optimal solution for Fractional Knapsack. (b) Find the optimal solution for 0-1 Knapsack.

1. Consider an instance of the Knapsack Problem without repetitions with 4 items, having weights and values as follows. The weights (in pounds) are w1=2, w2 =7, w3 =10, w4 =12. The dollar values of these items are respectively v1 = 12, v2 = 28, v3 = 30, v4 = 5. The capacity of the knapsack is 12. (a) Find the optimal solution for Fractional Knapsack. (b) Find the optimal solution for 0-1 Knapsack.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter13: Decision Making Under Uncertainty

Section13.3: Flaws In Expected Maximization Of Utility: Prospect Theory And Framing Effects

Problem 4P

See similar textbooks

Similar questions

Q-1. Consider the Farmer-Wolf-Goat-Cabbage Problem described below: Farmer-Wolf-Goat-Cabbage Problem There is a farmer with a wolf, a goat and a cabbage. The farmer has to cross a river with all three things. A small boat is available to cross the river, but farmer can carry only one thing with him at a time on the boat. In the absence of farmer, the goat will eat the cabbage and wolf will eat the goat. How can the farmer cross the river with all 3 things? State Space Formulation of the Problem State of the problem can be represented by a 4-tuple where elements of the tuple represent positions of farmer, wolf, goat and cabbage respectively. The position of boat is always same as the position of farmer because only farmer can drive the boat. Initial state: (L, L, L, L) Operators: 1. Move farmer and wolf to the opposite side of river if goat and cabbage are not left alone. 2. Move farmer and goat to the opposite side of river. 3. Move farmer and cabbage to the opposite…
Consider the use of a genetic algorithm on this 0-1 Knapsack Problem W = 19 P1 = 20, w1 = 2 P2 = 30, w2 = 6 P3 = 36, w2 = 9 P4 = 16, w3 = 8 If an individual in the population is given the string: "0,1,0,1" then the measure of fitness would be?
Consider the search problem represented in Figure, where a is the start node and e is the goal node. The pair [f, h] at each node indicates the value ofthe f and h functions for the path ending at that node. Given this information, what is the cost ofeach path?1. The cost < a, c >= 2 is given as a hint.2. Is the heuristic function h admissible? Explain
Consider a Diffie-Hellman scheme with a common prime q = 11 and a primitive root α = 2. Show that 2 is a primitive root of 11. If user A has public key YA = 9, what is A’s private key XA? If user B has public key YB = 3, what is the secret key K shared with A?
a. Given n items, where each item has a weight and a value, and a knapsack that can carry at most W You are expected to fill in the knapsack with a subset of items in order to maximize the total value without exceeding the weight limit. For instance, if n = 6 and items = {(A, 10, 40), (B, 50, 30), (C, 40, 80), (D, 20, 60), (E, 40, 10), (F, 10, 60)} where each entry is represented as (itemIdi, weighti, valuei). Use greedy algorithm to solve the fractional knapsack problem. b. Given an array of n numbers, write a java or python program to find the k largest numbers using a comparison-based algorithm. We are not interested in the relative order of the k numbers and assuming that (i) k is a small constant (e.g., k = 5) independent of n, and (ii) k is a constant fraction of n (e.g., k = n/4). Provide the Big-Oh characterization of your algorithm.
Please don't use handwritting for this question How would you modify the dynamic programming algorithm for the coin collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X’s. How many optimal paths are there for this board? You need to provide 1) a modified recurrence relation, 2) a pseudo code description of the algorithm, and 3) a table that stores solutions to the subproblems.
Solve the 0/1 Knapsack problem given that: The Knapsack can only carry a maximum of 8 Kg. The items are 2 Kg with a value of Ksh 100, 3 Kg with a value of Ksh 120, 5 Kg with a a value of Ksh 140, 1 Kg with a value of Ksh 60, and 6 Kg with a value of Ksh 150.
How would you modify the dynamic programming algorithm for the coin collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X’s. How many optimal paths are there for this board? You need to provide 1) a modified recurrence relation, 2) a pseudo code description of the algorithm, and 3) a table that stores solutions to the subproblems.
Consider the following bridge crossing problem where n people with speeds s1, ··· , sn wish to cross the bridge as quickly as possible. The rules remain: • It is nighttime and you only have one flashlight. • A maximum of two people can cross at any one time • Any party who crosses, either 1 or 2 people must have the flashlight with them. • The flashlight must be walked back and forth, it cannot be thrown, etc. • A pair must walk together at the rate of the slower person’s pace. Give an efficient algorithm to find the fastest way to get a group of people across the bridge. You must have a proof of correctness for your method.
Algorithm of 0/1 - Knapsack problem, [dynamic programming and set method]=====================================================================Object(s): | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |Benefit(s): | 3 | 4 | 5 | 6 | 5 | *1 | 8 | *2 | (unit)Weight(s): | 2 | 4 | 6 | 7 | 9 | 10 | 12 | 13 | (unit)*1 = Last digit of your Stud_ID number*2 = Summation of first and last digit of your Stud_ID numberCapacity of the storage or bag (C) = 30 (unit)Carry objects by using the given storage or bag (C) and find out the maximum benefit(s) with these limitations by 'Algorithm of 0/1 - Knapsack problem'.
Consider the following popular puzzle in discrete math. When asked for the ages of her three children, Mrs. Baker says that Alice is her youngest child if Bill is not her youngest child, and that Alice is not her youngest child if Carl is not her youngest child. Write down a knowledge base that describes this riddle and the necessary background knowledge that only one of the three children can be her youngest child. Show with resolution that Bill is her youngest child.
My question is regarding the knapsack problem. How do i apply the knapsack problem on a table like the given one. In my script it says: " For that put the numbers Opt[k,V] for k=1,..,5 and V= 1,....,9 in a table.For that Opt[k,V] is a partial solution which one obtains for the first k items at maximum weight V receives. I tried to apply the definition of the script on the table, maybe i did it wrong. How do i do it?