Integer programming help

Consider the Integer programming problem: maximize 3.21 + 2.62 subject to 4.01 +2:22 0 X1, X2 integer. Using figures, justify the answers to the following questions. Highly or write in a diffrent color the answer for each question. 1. What is the optimal cost of the linear programming relaxation? What is the optimal cost of the integer programming problem? 2. Draw the convex hull of the set of all solutions to the integer programming problem. How does the solution to the IP compare to the solution when the feasibility region is replaced by this convex hull? 3. Give the first Gomory cut for this problem. (Write the problem in standard form, specify the constraints where you are performing the cut and the resulting constraint after the cut.) Consider the Integer programming problem: maximize 3.21 + 2.62 subject to 4.01 +2:22 0 X1, X2 integer. Using figures, justify the answers to the following questions. Highly or write in a diffrent color the answer for each question. 1. What is the optimal cost of the linear programming relaxation? What is the optimal cost of the integer programming problem? 2. Draw the convex hull of the set of all solutions to the integer programming problem. How does the solution to the IP compare to the solution when the feasibility region is replaced by this convex hull? 3. Give the first Gomory cut for this problem. (Write the problem in standard form, specify the constraints where you are performing the cut and the resulting constraint after the cut.)