1. [25 Pt.] 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:

1. [5 Pt.] As an LP problem, identify the feasible solution area and shade it above graph.
2. [5 Pt.] Which points are the extreme points? Find the coordinates of each extreme point.
3. [5 Pt.] In the feasible solution area in (i), identify all the possible integer solution points as an IP problem.
4. [5 Pt.] Based on (iii), compute the optimal objective values in LP.

[5 Pt.] Based on (iii), compute the optimal objective values in IP

A , C E D F G H K L J M N