Question: Consider the following all-integer linear program. Max 1x1 + 1x2 s.t. 4x1 + 7x2 39 1x1 + 5x2 20 2x1 + 1x2 17 x1, x2
Consider the following all-integer linear program.
Max 1x1 + 1x2
s.t.
4x1 + 7x2 39
1x1 + 5x2 20
2x1 + 1x2 17 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.
______________ at (x1, x2) = (____________)
(c) Find the optimal integer solution.
_______________at (x1, x2) = (___________)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
