Posted by nmh on Friday, July 8, 2011 at 2:52pm.
We are not going to do all your linear programming problems for you. I will rough out one of them. Then you try and post your work if you want feedback.
b = number of bookcases
t = number of tables
constraints:
Department 1:
2 b + 3 t </= 40
Department 2:
4 b + 2 t </= 36
Profit to maximize:
p = 6 b + 7 t
corner points: (b,t)
(0,0)
(0,13.33) because 13.33<36/2
(9,0) because 9<20
then the intersection
t = 11 and b = 3.5 or (3.5,11)
check corners for p =6 b + 7 t
(0,0) gives 0 profit
(0,13.33) gives 6*0+7*13.33=93.31
(9,0) gives 6*9 = 54
(3.5,11) gives 6*3.5+7*11 = 98 winner
I am assuming fractional bookcases and tables can be built because you presumably can spread this out over many weeks.
Related Questions
Phoenix - In planning for a new item, a manufacturer assumes that the number of ...
math - You are a manufacturer of a certain item. Youve calculated that you...
linear programming - A manufacturer has a maximum of 240, 360, and 180 ...
Algebra - In planning for a new item, a manufacturer assumes that the number of ...
linear equations - A manufacturer makes two products A and B, each of which is ...
math,correction - The problem states: In planning for a new item, a manufacturer...
System of Linear Equations - A manufacturer makes two products A and B, each of...
math - Help I can go this far and then lost. In planning for a new item, a ...
linear programming - Exeter Mines produces iron ore at four different mines; ...
HELP A.S.A.P. PLEASE: linear programming-maths - A company makes tennis and ...
For Further Reading