Posted: April 14th, 2021

Consider the following mixed-integer linear program:

Max1x1 + 1×2

s.t.

7×1 + 9×2 = 63

9×1 + 5×2 = 45

3×1 + 1×2 = 12

x1, x2 ?Y 0 and x2 integer

a. Graph the constraints for this problem. Indicate on your graph all feasible mixed-integer solutions.

b. Find the optimal solution to the LP Relaxation. Round the value of x2 down to find a feasible mixed-integer solution. Specify upper and lower bounds on the value of the optimal solution to the mixed-integer linear program.

c. Find the optimal solution to the mixed-integer linear program.

Place an order in 3 easy steps. Takes less than 5 mins.