Given the following all-integer linear program: Max 3x1 + 2x2 s.t. 3x1 + x2 59 X1 + 3x2 5 7 -X1 + x2 = 1 X1, X2 = 0 and integer Solve the problem as a linear program ignoring the integer constraints. Show that the optimal solution to the linear program gives fractional values for both X1 and x2. What solution is obtained by rounding fractions greater than or equal to 1/2 to the next larger number? Show that this solution is not a feasible solution. By rounding x1 and x2 to the nearest integer, we get x1 = and x2 This point is (feasible / infeasible). What is the solution obtained by rounding down all fractions? Is it feasible? By rounding x1 and x2 down, we get x1 = and x2 = This point is (feasible / infeasible). If feasible, what is the objective value (If it is not feasible, simply write 0 for the obj value.) Enumerate all points in the linear programming feasible region in which both x1 and x2 are integers, and show that the feasible solution obtained in the previous part is not optimal and that in fact the optimal integer is not obtained by any form of rounding. A partially filled table is provided for your convenience. Given the possible x1 values, complete the missing values for x2 and objective values. Alternative X1 X2 Z 1 0 2 1 3 2 4 3 5 0 6 1 7 2 8 1 Run the model in Excel Solver, this time adding integrality condition as well. (Make sure all decision variables can only take integer values) What is the optimal solution and its objective value? (Note: you can double-check your answer from the table you filled in the previous part) X1 X2 Objective