A factory manufactures chairs and tables, each requiring the use of three operations: cutting, assembly, and finishing. The first operation can use at most 40 hours; the second at most 42 hours; and the third at most 25 hours. A chair requires 1 hour of cutting, 2 hours of assembly, and 1 hour of finishing; a table needs 2 hours of cutting, 1 hour of assembly, and 1 hour of finishing. If the profit is $20 per unit for a chair and $30 for a table, what is the maximum revenue? Round your answer to the nearest whole number. Do not include a dollar sign or comma in your answer.

z(max) = 650 $

x₁ = 10 units

x₂ = 15 units

Step-by-step explanation:

That is a linear programming problem, we will use a simplex method to solve it

Formulation:

Let´s call  x₁  number of chairs   and x₂ number of tables then :

Item              (in hours)     cutting       assembly      finishing        Profit ($)

Chairs (x₁)                              1                   2                     1                      20

Tables (x₂)                              2                   1                      1                      30

Availability                           40                 42                   25

Objective Function

z  =  20*x₁   +  30x₂   ( to maximize) subject to:

x₁  +  2x₂   ≤  40

2x₁  + x₂    ≤  42

x₁ + x₂     ≤    25

x₁  ,   x₂  >= 0

Using excel or any other software we find:

z(max) = 650

x₁ = 10

x₂ = 15

-14

step-by-step explanation:

2x2 – 2(x+4)

=2x2-2（5+4）

=4-2×9

=4-18

=-14

y -5 = (-1/4)(x + 8)

step-by-step explanation: