A furniture manufacturer makes two types of furniture: chairs and sofas. The production of the sofas and chairs requires three operations: carpentry, finishing, and upholstery. Manufacturing a chair requires 3 hours of carpentry, 9 hours of finishing, and 2 hours of upholstery. Manufacturing a sofa requires 2 hours of carpentry, 4 hours of finishing, and 10 hours of upholstery. The factory has allocated at most 66 labor hours for carpentry, 180 labor hours for finishing, and 200 labor hours for upholstery. The prfit per chair is $90 and the profit per sofa is $75. The manufacturer wants to know how many chairs and how many sofas should be produced each day to maximize the profit. Formulate a linear programming (LP)problem you would use to find a solution.

Chair  x₁ = 10

Sofa   x₂ = 18

z(max)  = 2250 $

Step-by-step explanation:

Information:

Operation-Profit             Carpentry         Finishing      Upholstery     Profit

                                           hours                 hours              hours             $

Chair (x₁)                                3                        9                      2                90

Sofa  (x₂)                                 2                        4                     10               75

Objective Function z:

z =  90*x₁ + 75*x₂

Constrains:

1.-66 hours of carpentry available

3*x₁ + 2*x₂ ≤ 66

2.- 180  hours of finishing available

9*x₁  +  4*x₂ ≤  180

3.- 200 hours of upholstery

2*x₁  +  10*x₂  ≤ 200

Model:

z = 90*x₁ + 75*x₂    to maximize

Subject to:

3*x₁ + 2*x₂ ≤ 66

9*x₁  +  4*x₂ ≤  180

2*x₁  + 10*x₂  ≤ 200

x₁ >= 0  x₂ >= 0

From simplex method solver we get the answer

x₁ = 10         x₂  = 18       z = 2250

x

step-by-step explanation: