Question: Consider the following all-integer linear program: Max1 x 1 +1 x 2 s.t.4x 1 + 6x 2 22 1x 1 + 5x 2 15 2x
Consider the following all-integer linear program:
Max1x1 +1x2
s.t.4x1 + 6x222
1x1 + 5x215
2x1+ 1x29
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.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
