Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 5x1 + 6x2 32 10x1 + 5x2 46 x1 + 2x2 10 x1, x2 0 and integer Choose the correct graph which shows the constraints for this problem and uses dots to indicate all feasible integer solutions.

(i) (ii) (iii) (iv)

Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places.

x1= x2= Optimal Solution to the LP Relaxation

Round down to find a feasible integer solution. If your answer is zero enter 0.

x1= x2= Feasible integer solution

Find the optimal integer solution. If your answer is zero enter 0.

x1= x2= Optimal Integer Solution

Is it the same as the solution obtained in part (b) by rounding down?