We have,
Let x units of food A
y units of food B
Where x≥0,y≥0
Then table
We are to minimize
z=5x+4y
Subject to constraints
200x+100y≥4000
2x+y≥40......(1)
x+2y≥50......(2)
40x+40y≥1400
x+y≥35.......(3)
wherex≥0,y≥0
From equation (1) to and we get,
2x+y=40
If x=0 then y=40 OY in L(0,40)
If y=0 then x=20 OX in A(20,0)
From equation (2) to and we get,
x+2y=50
If x=0 then y=25 OY in M(0,25)
If y=0 then x=50 OX in B(50,0)
From equation (3) to and we get,
x+y=35
If x=0 then y=35 OY in N(0,35)
If y=0 then x=35 OX in C(35,0)
Shaded region is the feasible region, which is unbounded.
Then,
Corner point is
B(50,0)
D(20,15)
E(5,30)
L(0,40)
At point B(50,0)⇒Z=5(50)+4(0)=250
At point D(20,15),Z=5(20)+4(15)=100+60=160
At point E(5,30),Z=5(5)+4(30)=25+120=145
At point L(0,40),Z=5(0)+4(40)=0+160=160
Then at least cost =Rs145at(5,30)
Hence, this is the answer.