An optimization programming model is formulated as follows:

Max. = + 2

s.t.

3 + 3

+ 3 2

+ 2 2

5 + 15

2 4

, 0

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

i. As an LP problem, identify the feasible solution area and shade it above graph.

ii. Which points are the extreme points? Find the coordinates of each extreme point.

iii. In the feasible solution area in (i), identify all the possible integer solution points as an IP problem.

iv. Based on (iii), compute the optimal objective values in LP.

v. Based on (iii), compute the optimal objective values in IP.

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