Question: Consider the following all-integer linear program. Max 5x1 + 8x2 s.t. 6x1 + 5x2 35 9x1 + 4x2 = 36 1x1 + 2x2 = 12

Consider the following all-integer linear

Consider the following all-integer linear program. Max 5x1 + 8x2 s.t. 6x1 + 5x2 35 9x1 + 4x2 = 36 1x1 + 2x2 = 12 X1, X220 and integer (a) Graph the constraints for this problem. Use points to indicate all feasible integer solutions. X2 X2 X2 X2 8 8 8 8 6. 6 6 6 4 4 2 2 X1 X1 X1 X1 2 6 8 4 6 8 2 4 6 8 4 6 8 (b) Find the optimal solution to the LP Relaxation. (Round your answers to three decimal places.) at (x1, x2) = Using this solution, round down to find a feasible integer solution. at (x1, x2) = - (C (c) Find the optimal integer solution. at (x1, x2) = Is it the same as the solution obtained in part (b) by rounding down? O Yes O No

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!