(i) Write down the dynamic programming table for a knapsack problem with 6 items of weight 4,3,2,1,2,3, value 3,3,2,3,3,4 and weight limit 6. Give all optimum solutions. (ii) Write down the dynamic programming table for a knapsack problem with 5 items of weight 2,3,5,1,2, value 3,4,6,2,2 and weight limit 7. Give all optimum solutions.

(i) Write down the dynamic programming table for a knapsack problem with 6 items of weight 4,3,2,1,2,3, value 3,3,2,3,3,4 and weight limit 6. Give all optimum solutions. (ii) Write down the dynamic programming table for a knapsack problem with 5 items of weight 2,3,5,1,2, value 3,4,6,2,2 and weight limit 7. Give all optimum solutions.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter9: Integer Programming

Section9.2: Formulating Integer Programming Problems

Problem 45P

See similar textbooks

Similar questions

3. Knapsack problem (4’)a. (1’) Show the dynamic programming table when applying the bottom-up dynamicprogramming algorithm to the instance of the knapsack problem? (Capacity W=6)b. (1’) Show the dynamic programming table when applying MemoryKnapsack(i, j)dynamic programming algorithm to the instance of the knapsack problem? (CapacityW=6)c. (1’) What is the optimal subset?d. (1’) What is the maximal value of a feasible subset?
knapsack problem: given the first table: c beeing value and w beeing weight, W max weight. I got table 2 as a solution to: 2 Solve the Knapsack problem with dynamic programming. To do this, enter the numbers Opt[k,V ] for k = 1,...,5 and V = 1,...,9 in a table. Here Opt[k, V ] is the partial solution obtained for the first k items with maximum weight V. " Can somebody explain me the values of the table? How do they get calculated? Also how do i solve the followup-task: Using the values in the table, determine a solution OPTSOL(I)=(β1,β2,β3,β4), starting with β4. (Use backtracing to do this)
The Manhattan Tourist Problem (1) Given setting in Figure 6.4, calculate exact number of different paths by dynamic programming. (2) For a general setting, i.e., from source(0,0) to sink (n, m), how many different paths by dynamic programming?1 4 3 3 4 1 0 4 3 N 5 1
Does this help to define "optimality" in the context of dynamic programming?
The issue is said to have the given property if it is feasible to develop an optimum solution for the problem by first successfully creating optimal solutions for each of the problem's subproblems. a) Subproblems that overlap one another; b) achieving optimum substructure; c) memory; and d) being greedy
7. The valid questions for Dynamic Programming are 1) Principle of Optimality (Optimal Substructure), and 2) the condition of insufficient Overlapping Subproblems. Take the example of All-Pairs Shortest Paths as an example to illustrate the problem of satisfying these two conditions.
Give a complete problem formulation for each of the following problems. Choose a formulation that is precise enough to be implemented. d. A container ship is in port, loaded high with containers. There 13 rows of containers, each 13 containers wide and 5 containers tall. You control a crane that can move to any location above the ship, pick up the container under it, and move it onto the dock. You want the ship unloaded.
The missionaries and cannibals problem is usually stated as follows. Three missionariesand three cannibals are on one side of a river, along with a boat that can hold one ortwo people. Find a way to get everyone to the other side without ever leaving a group of missionariesin one place outnumbered by the cannibals in that place. This problem is famous inAI because it was the subject of the first paper that approached problem formulation from ananalytical viewpoint (Amarel, 1968).b. Implement and solve the problem optimally using an appropriate search algorithm. (Mention the name of the search algorithm, and write the complete answers, Draw the answer using the searching algorithms with complete and all paths and branches.)
If it is possible to solve the problem by first solving its subproblems, the issue has the provided attribute. overlapping subproblems, optimal substructure, memory, and greed.
Please explain! Dynamic Programming can be used to solve numerous real-life optimization problems. Consider these six problems.Five of these six problems have elegant and efficient solutions using Dynamic Programming, but one of these problems does not. Which of these six problems cannot be solved using Dynamic Programming? Choice 1 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to maximize your profit Choice 2 of 6: Given a rod, and a set of prices p[i] for each cut of length i, determine how to cut the rods to minimize your profit Choice 3 of 6: Given a graph, determine the shortest path from the start vertex to the end vertex without repeating any edges Choice 4 of 6: Given a graph, determine the longest path from the start vertex to the end vertex without repeating any edges Choice 5 of 6: Given a sequence of integers, determine the longest increasing subsequence of that sequence Choice 6 of 6: Given a sequence of integers,…
Explain the relationship between the Bellman equation and the principle of optimality in dynamic programming.
identify the following problem components: (a) decision variables; (b) parameters; (c) the objective function in words; and (d) constraints in words. Structures. A singly reinforced rectangular concrete beam must carry a known imposed moment and shear. The span length is also known, and the deflection of the beam must not exceed a certain value. The width and depth of the beam are to be determined, as is the area of steel to be placed in the bottom of the beam. The cost of concrete per-cubic-yard and the cost of steel per-pound is known, as is the compressive strength of the concrete and yield strength of the steel. The designer wants to design the least-cost beam. The code for such beams states that a certain minimum amount of steel, as a percent of the tot al effective cross sectional area, must be present in order to avoid excessive cracking on the bottom of the beam due to temperature fluctuations. The code also gives a limit on the maximum amount of steel, again expressed as a…