Thursday

August 21, 2014

August 21, 2014

Posted by **nmh** on Friday, July 8, 2011 at 2:52pm.

Identify all constraints.

Identify all applicable corner points of the feasibility region.

If all units produced can be sold, how many of each should be made in order to maximize profits?

- linear programming -
**Damon**, Friday, July 8, 2011 at 3:15pmWe 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**

math - The table below shows the number of hours required in each of two ...

Math - The table below shows the number of hours required in each of two ...

MATH- please help! - The table below shows the number of hours required in each ...

MATH-PLEASE HELPPP!!!! - The table below shows the number of hours required in ...

linear equations - A manufacturer makes two products A and B, each of which is ...

System of Linear Equations - A manufacturer makes two products A and B, each of...

math - A manufacturer makes two products A and B, each of which is processed in ...

linear programming app - write the constraints as linear inequalities and ...

Math - A manufacturer makes two products A and B, each of which is processed in ...

Principles of Business - Approximately how many people work in the: Finance ...