Consider the following all-integer linear program:
Max s.t.
1x1 + 1x2
4x1 + 6x2 ... 22
1x1 + 5x2 ... 15
2x1 + 1x2 ... 9
x1, x2 Ú 0 and integer
a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions.
b. Solve the LP Relaxation of this problem.
c. Find the optimal integer solution.