Q2 Graphical properties of linear programming problem, 1. Find the feasible region by making it a shaded area. 2. Find all corner points of this problem by marking them with capital letters, i.e., A, B, etc. 3. Given the contour line (i.e. the objective function line) (dashed line), find the optimal solution 4. What are the binding constraints for the optimum. 5. We know that if we change the right hand sides of some constraints a tiny bit, the optimal solution will still be the same. Find all constraints of this type: (circle one from below) a. 1. 2. 3. 4 b. (1.2.4,6) c. 2, 3, 5, 6 d. 3. 4. 5. 6