MAT540 Homework Week 6 Page 1 of 2
kesfin
copy_of_hw6_answer_sheet_2015-2.xlsxP1
| Product Lines | ||||||
| Product #1 | Product #2 | |||||
| Profits for each product | 6 | 4 | ||||
| Total hours | Available hours | |||||
| Time required on Line #1 | 10 | 14 | <= | 100 | ||
| Time required on Line #2 | 7 | 3 | <= | 42 | ||
| Product #1 | ||||||
| Product #2 | ||||||
| Maximized profits | ||||||
| Please use graphic method to solve the problem | ||||||
| Please enter your solution in Yellow cells |
Note: Line #1 and Line #2 must be >= 0
P2 and P3
| Pinewood Furniture | |||||||
| Table | Chair | ||||||
| Profits for each product | 100 | 400 | |||||
| Resources | Available labor & material resources | Unused resources | |||||
| Labor | 10 | 8 | <= | 80 | |||
| wood | 6 | 2 | <= | 36 | |||
| Chair demands | <= | 6 | 6 | ||||
| Tables | |||||||
| Chairs | |||||||
| Maximized profits | |||||||
| Please use graphic method to solve the problem | |||||||
| Please enter your solution in Yellow cells |
P4
| Elixer Drug Company | ||||||
| Ingredient #1 | Ingredient #2 | |||||
| Profits for each product | 80 | 50 | ||||
| Antibiotic amounts | Required antibiotics | |||||
| Antibiotic #1 | 3 | 1 | >= | 6 | ||
| Antibiotic #2 | 1 | 1 | >= | 4 | ||
| Antibiotic #3 | 2 | 6 | >= | 12 | ||
| Ingredient #1 | ||||||
| Ingredient #2 | ||||||
| Minimized cost | ||||||
| Please use graphic method to solve the problem | ||||||
| Please enter your solution in Yellow cells |
P5
| Clothier | ||||||
| Coats | Slacks | |||||
| Profits for each product | 50 | 40 | ||||
| Resources | Available Resources | |||||
| Wool | 3 | 5 | <= | 150 | ||
| Labor | 10 | 4 | <= | 200 | ||
| Coat | ||||||
| Slacks | ||||||
| Maximized profits | ||||||
| Please use graphic method to solve the problem | ||||||
| Please enter your solution in Yellow cells |
P6
| Clothier | ||||||
| x1 | x2 | |||||
| weights | 5 | 8 | ||||
| Resources | Available Resources | |||||
| constraint #1 | 4 | 5 | <= | 50 | ||
| constraint #2 | 2 | 4 | <= | 40 | ||
| x1 | <= | 8 | ||||
| x2 | <= | 8 | ||||
| x1 | ||||||
| x2 | ||||||
| Maximize Z | ||||||
| Please use graphic method to solve the problem | ||||||
| Please enter your solution in Yellow cells |
