We have, Minimize Z=20x1+9x2,
subject to 2x1+x2≥36,6x1+x2≥60, x1≥0, x2≥0
Let l1:2x1+x2=36,l2:6x1+x2=60 l3:x1=0 and l4:x2=0 For B : Solving l1 and l2, we get B(6,24)
Shaded portion is the feasible region, where A(18,0),B(6,24),C(0,60)
Now minimize Z=20x1+9x2 Z at A(18,0)=20(18)+9(0)=360 Z at B(6,24)=20(6)+9(24)=336 Z at C(0,60)=20(0)+9(60)=540
Thus, Z is minimized at B(6,24) and its minimum value is 336.