Let the following all-integer linear program:
Max 1x1 + 1x2
s.t.
4x1 + 6x2 < 22
1x1 + 5x2 < 15
2x1 + 1x2 < 9
x1, x2 > 0
a. Sketch the graph of the constraints for this problem.
b. Solve LP problem and recognize the feasible region, corner point solutions, and optimal solution.