Consider the linear programming problem: Maximum z = 4x + y Subject to constraints: x + y < 50, 3x + y < 9x, y < 0
(a) Draw the feasible region
(b) Find the corner points of the feasible region
(c) Find the corner at which ‘z’ attains its maximum value