Respuesta :
Answer:
32 is not minimum value of C
Step-by-step explanation:
Given constraints:
[tex]2x+y\geq8[/tex]
[tex]x+y\geq8[/tex]
[tex]x\geq8[/tex]
[tex]y\geq8[/tex]
Now we draw the graph of each constraint and see the feasible region in graph. Please have a look attached graph.
We got three corner points A(0,8) B(2,4) and C(6,0)
Now we find the optimal solution for each value of corner points.
C(0,8)=7(0)+8(8)=64
C(2,4)=7(2)+8(4)=14+32=46
C(6,0)=7(6)+8(0)=42
Option A is correct. 32 is not minimum value of C

Answer:
we have to find minimum value of c=7 x+8 y
Constraints are
2x+y>=8
x+y>=6
x>=0
y>=0
The points which satisfy the above inequality is (2,4),(6,0),(0,8).
At (2,4) , C= 7×2+8×4=14+32=46
At(6,0), C=7×6+8×0=42
At (0,8), C=7×0+8×8=64
So option A which is 32 is not the minimum value of C=7 x+ 8 y.
