Professional Documents
Culture Documents
Solver Tutorial Problems
Solver Tutorial Problems
Fall 2007 Excel Solver Tutorial The Problem: Consider a knapsack problem like the kind discussed in class (and in the supplementary notes). We have four divisible goods with the weights and values listed below. How much of each good should we place in our knapsack (with capacity 15lbs) to maximize the total value of the contents? Weight 17 11 6 12 15 Value 4 2 6 5
1 2 3 4 capacity:
Goods
The Problem: We have 3 MS&E students and 3 potential advisors. We wish to match students to advisors in such a way that each student has exactly one advisor and each advisor has exactly one student (professors don't like being overworked). However, not all matchings are equivalent- each possible pairing results in a distinct "happiness" level given in the table below. How should we match students and advisors to maximize the total happiness of the members of the department? Advisors 1 1 6 2 7 3 5.5
2 2 9 7.5
3 7.5 8 3
Students
Convert the problem into a standard form LP and solve. Does the problem have any non-integer solutions? Does Excel ever return a non-integer solution?
1 2 3 4 5 6 7 8 9 10 11 12
4 0 0 1 0 0 0 0 0 0 1 0 0
5 0 1 0 1 0 1 0 0 0 0 1 0
6 1 0 0 0 0 0 0 0 0 0 0 1
7 1 0 1 0 0 0 1 0 0 0 0 1
8 0 0 1 0 1 0 0 0 1 0 0 1
Jobs
9 0 0 1 0 0 0 1 0 0 0 0 0