You are provided with the following integer program: max z = x + 2y s.t.

x y 3

x + 7 /8 y 7

y 4.5

x, y 0 and integer

a.) On the graph paper provided on the following page, use the graphical solution method to identify the feasible points on your graph. (Use the scale 1 by 1 for each small square so that you can visually detect the feasible integer solutions.)

b.) Enumerate the feasible extreme points of the convex hull and calculate their objective values.

c.)Draw an isoprofit line that passes through the point (x = 2, y = 2) and find the direction of optimization.

d.)Provide the optimal solution and optimal objective function value.