Problem:
Integer (linear) programming model problem
Solve the following integer (linear) programming model problem graphically by manual hand-drawn construction of the graph.
Minimize 6X + 11Y
Subject to 9X + 3Y > 27
7X + 6Y > 42
4X + 8Y > 32
X, Y > 0 and integer
a. Graph the constraints for this problem. Indicate all feasible solutions.
b. Find the optimal solution to the LP model without integer restrictions. Round up to find a feasible integer solution. Is this solution optimal?
c. Find the optimal solution for the original model as given.