Maximize x + 2y s.t.

5 + 2 10 3 + 7 21 2 + 18 18

, 0

For the Linear Programming model given above, do the following:

1. (a) Draw the graphical representation of the model indicating each constraint and the objective function clearly.

2. (b) Identify the feasible region on the graph.

3. (c) Identify corner point solutions for the feasible region and show them on the graph. Show

   all your equations and calculations while identifying each corner point solution.

4. (d) Find the optimal solution to the given model and the best value of the objective function

   using the corner point method.