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
Answer:
62.7%
Step-by-step explanation:
(94 / 150) * 100
0.62666... * 100
=62.666...
=62.7%
Answer:
equivalent ratio for this question is
4:6:48
Answer:
3.3
Step-by-step explanation:
1/4*3 = 3/12 (find lcd lowest common factor )
5/6 *2 10/12 figure out how many time 3 goes into 10 about 3.3 repeating
