Question 4: State true or false. +2 points for each correct answer and no penalty for each wrong answer. You can write down your reason to get the partial credit. Example question: After returning the mid-term, you have one week to appeal True False the grading. 1 It is possible to have a linear program that has exactly two optimal solutions. True False Reason: True False 2 A point in n-variable linear programming problem has n non-binding constraints. Then, it must be the extreme (corner) point. Reason: 3 An extreme(corner) point in n-variable linear programming problem must have at least (n+1) binding constraints. Reason: True False True False 4 If the feasible region of a linear programming problem is unbounded, then the optimal value must be unbounded. Reason: 5 In the simplex algorithm, each iteration must improve the objective value. Reason: True False