For the following linear programming problem optimal solution is found at the intersection of constraint one and two.
Max 200x+160y
S.t 50x+40y <= 3000
25x+28y >= 1800
20x+15y <= 1500
X,y>= 0
1. Find the feasible region
2. Find optimal solution for the problem
3. Will there be any excess in any resource?