For each following case, find optimal solution (s) using a graph method (i.e., draw a feasible region (clearly by shading it) and indicate the optimal solution(s) in the graph) (1) [20] Max. z = X + X Subject to X + 2X = 0 (2) [20] Min. z = -X - 4X Subject to X + 4X >= 4 -X >= -1 X, X >= 0 1| Page

\#1. [40] For each following case, find optimal solution(s) using a graph method (i.e., draw a feasible region (clearly by shading it) and indicate the optimal solution(s) in the graph) (1) [20] Maxz=X1+X2 Subject to x1+2x2=0 (2) [20] Min. z=X14X2 Subject to x1+4x2>=4x1>=1x1,x2>=0 \#1. [40] For each following case, find optimal solution(s) using a graph method (i.e., draw a feasible region (clearly by shading it) and indicate the optimal solution(s) in the graph) (1) [20] Maxz=X1+X2 Subject to x1+2x2=0 (2) [20] Min. z=X14X2 Subject to x1+4x2>=4x1>=1x1,x2>=0