Question: Solution may be from excel Problem 2: Knapsack Problem . . N items can be put into a knapsack Each time has a certain weight

Solution may be from excel
Problem 2: Knapsack Problem . . N items can be put into a knapsack Each time has a certain weight and a value Determine how many units of each item to place in the knapsack to maximize the total value Constraint is placed on the maximum weight Similar to a manger who must make a biweekly selection of jobs from each of four categories to process during a 2-week period 29 Job Data for the Manufacturing Operation Job Category No. of Jobs to be processed 4 Estimated Completion time per job Value rating per job A 1 2 B 3 3 8 Select certain jobs during the next 2 weeks such that all the jobs selected can be processed within 10 working days and the total value of the jobs is maximized 2 4 11 D 2 7 20 Problem 2: Knapsack Problem . . N items can be put into a knapsack Each time has a certain weight and a value Determine how many units of each item to place in the knapsack to maximize the total value Constraint is placed on the maximum weight Similar to a manger who must make a biweekly selection of jobs from each of four categories to process during a 2-week period 29 Job Data for the Manufacturing Operation Job Category No. of Jobs to be processed 4 Estimated Completion time per job Value rating per job A 1 2 B 3 3 8 Select certain jobs during the next 2 weeks such that all the jobs selected can be processed within 10 working days and the total value of the jobs is maximized 2 4 11 D 2 7 20
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
