Consider the following IP problem: maximize Z = 5×1 + x2, su…

Consider the following IP problem: maximize Z = 5×1 + x2, subject to: – x1 + 2×2 ≤ 4 x1 – x2 ≤ 1 4×1 + x2 ≤ 12 x1 ≥ 0, x2 ≥ 0 x1, x2 are integers. a)Solve this problem graphically (i.e., report the optimal values of the objective function and the decision variables). (20 points) b)Solve the LP relaxation graphically. Round this solution to the nearest integer solution and check whether it is feasible. (20 points)

Assume that we are using the network simplex method to solve…

Assume that we are using the network simplex method to solve a minimum cost flow problem. Also assume that the following graph shows an intermediate solution during the implementation. Which of the following arcs can be removed (i.e., become a nonbasic arc) from the current solution to create a spanning tree solution? OPAN 5023 Final Q2.png