Thank you

2. [25%] Consider the linear program: MIN 2X + 4Y Subject to: Ci: 4X + 4Y > 24 C2: 3X 2Y = 4 C3: -6X + 10Y 15 X > 0, and integer Y > 0 (a) Create a graph and clearly outline the feasible region. (b) Find the optimum decision variable values and objective function value for the LP Relaxation problem. Which constraints are binding? (c) Round the value of X found in part (b) to the nearest integer. What is the value of the objective function? Is this a feasible solution? (d) Find the optimum decision variable values and objective function value for the mixed-integer problem. Which constraints are binding