An optimization programming model is formulated as follows:

Max Z = x + 2y

s.t. 3x + y 3

x + 3y 2

- x + 2y 2

5x + y 15

2x - y 4

x, y 0

and the constraints in the model are illustrated in a plot as

(Do not use excel to solve)

1. As an LP problem, identify the feasible solution area and shade the area in any color on the graph.
2. 1. In the feasible solution area identify all the possible integer solution points as an IP problem.
      1. Based on (i), compute the optimal objective value _LP in LP.
      2. Based on (i), compute the optimal objective value and _IP in IP.

B C E D F G H K L M N 2