14. When we solve a Linear Programming problem, sometimes the Simplex Algorithm fails to terminate. What can we conclude about its optimal solution? a. Infeasible b. Infinite number of optimal solutions c. No solution d. Nothing, it may have or may not have optimal solution(s) e. Unbounded f. None of above 15. What is the key idea of the Bland's Anti-Cycling Rule for selecting entering and leaving variables (if you have options)? a. Always select the variable with the smallest index number b. Always select the variable with the largest positive coefficient (or largest negative coefficient for the tableau version) c. Always randomly select one variable. d. None of above 16. If two feasible region corner points x' =(4,2) and x" - (8,6) are optimal solutions for a Linear Programming problem with optimal z value 2. If the objective function z = x4 x2, which of the following is an optimal solution too? a. (2,0) only b. (3, 1) only c. (5,3) only d. Both answers a and b e. All answers a, b, and c f. Answer a is for sure, maybe answer b too g. Answer b is for sure, maybe answer a too h. None of above