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:
red: x
blue: 2x+3
Step-by-step explanation:
let the number of red chips= x
let the number of blue chips= 2x+3
Answer:
<h2>7a +2.........................</h2>
Answer:
one 40% discount
Step-by-step explanation:
lets use 100$ total for an example.
Say we have 40% of 100 so the total would be 60$ but it we have 20% and then another 20% off that we would have a final total of 64$\
Prove: 100*.4=40 100-40=60
100*.2=20 100-20=80, 80*.2=16 80-16= 64$
