Answer:
Its 6/35
Step-by-step explanation:
Answer:
z (min) = 360 x₁ = x₃ = 0 x₂ = 3
Step-by-step explanation:
Protein Carbohydrates Iron calories
Food 1 (x₁) 10 1 4 80
Food 2 (x₂) 15 2 8 120
Food 3 (x₃) 20 1 11 100
Requirements 40 6 12
From the table we get
Objective Function z :
z = 80*x₁ + 120*x₂ + 100*x₃ to minimize
Subjet to:
Constraint 1. at least 40 U of protein
10*x₁ + 15*x₂ + 20*x₃ ≥ 40
Constraint 2. at least 6 U of carbohydrates
1*x₁ + 2*x₂ + 1*x₃ ≥ 6
Constraint 3. at least 12 U of Iron
4*x₁ + 8*x₂ + 11*x₃ ≥ 12
General constraints:
x₁ ≥ 0 x₂ ≥ 0 x₃ ≥ 0 all integers
With the help of an on-line solver after 6 iterations the optimal solution is:
z (min) = 360 x₁ = x₃ = 0 x₂ = 3
Answer:(x-5)+(y-5)=9
Step-by-step explanation:
Only <span>first and second place runners:
</span>11*10=110 ways
Hope that helped.
