Respuesta :
Answer:
a) Objective function (minimize cost):
[tex]C=0.50A+0.20B[/tex]
Restrictions
Proteins per pound: [tex]16A+8B\leq 12[/tex]
Vitamins per pound: [tex]4A+8B\leq 6[/tex]
Non-negative values: [tex]A,B\geq0[/tex]
b) Attached
c) The optimum solution (minimum cost) is 0 pounds of ingredient A and 0.75 pounds of ingredient B. The cost is $0.15 per ration.
d) The optimum solution changes. The cost is now 0 pounds of ingredient A and 0.625 pounds of ingredient B. The cost is $0.125 per ration.
Step-by-step explanation:
a) The LP formulation for this problem is:
Objective function (minimize cost):
[tex]C=0.50A+0.20B[/tex]
Restrictions
Proteins per pound: [tex]16A+8B\leq 12[/tex]
Vitamins per pound: [tex]4A+8B\leq 6[/tex]
Non-negative values: [tex]A,B\geq0[/tex]
b) The feasible region is attached.
c) We have 3 corner points. In one of them lies the optimal solution.
Corner A=0 B=0.75
[tex]C=0.50*0+0.20*0.75=0.15[/tex]
Corner A=0.5 B=0.5
[tex]C=0.50*0.5+0.20*0.5=0.35[/tex]
Corner A=0.75 B=0
[tex]C=0.50*0.75+0.20*0=0.375[/tex]
The optimum solution (minimum cost) is 0 pounds of ingredient A and 0.75 pounds of ingredient B. The cost is $0.15 per ration.
d) If the company requires only 5 units of vitamins per pound rather than 6, one of the restrictions change.
The feasible region changes two of its three corners:
Corner A=0 B=0.625
[tex]C=0.50*0+0.20*0.625=0.125[/tex]
Corner A=0.583 B=0.333
[tex]C=0.50*0.583+0.20*0.333=0.358[/tex]
Corner A=0.75 B=0
[tex]C=0.50*0.75+0.20*0=0.375[/tex]
The optimum solution changes. The cost is now 0 pounds of ingredient A and 0.625 pounds of ingredient B. The cost is $0.125 per ration.
