Answer:
The solution is:
z (max ) = 446.25 $
x₁ = 55 x₂ = 0 x₃ = 5 x₄ = 70
Explanation:
From problem statement:
Nacholupa Quesatilla Enchinacho Burritaco
x₁ x₂ x₃ x₄
Cheese 2 4 2 4
meat 0 2 2 2
beans 4 0 2 0
Tortillas 3 1 3 1
Price $ 2.75 2 3 4
From table :
z = 2.75*x₁ + 2*x₂ + 3*x₃ + 4*x₄ to maximize
Subject to:
Availability of cheese: 400 ou
2*x₁ + 4*x₂ + 2*x₃ + 4*x₄ ≤ 400
Availability of meat : 150 ou
2*x₂ + 2*x₃ + 2*x₄ ≤ 150
Availability of beans : 400 ou
4*x₁ + 2*x₃ ≤ 400
Availability of tortillas : 250
3*x₁ + x₂ + 3*x₃ + x₄ ≤ 250
General constraints:
x₁ ≥ 0 x₂ ≥ 0 x₃ ≥ 0 x₄ ≥ 0
All integers
With the use of AtomZmath ( integer solving on-line software )
The solution is:
z (max ) = 446.25 $
x₁ = 55 x₂ = 0 x₃ = 5 x₄ = 70