A 10 9 8 D A E N 0 2 3 5 6 7 8 9 10 X 45. This linear programming problem is a: maximization problem minimization problem irregular problem D) cannot tell from the information given46. Which point is NOT feasible? A J C) H D) G E) B 47. Which of the following special cases does NOT require reformulation (correction) of the problem in order to obtain a solution? unboundedness in a maximization problem B) infeasibility alternate optimal solutions D) each one of these special cases requires reformulation (correction) 48. A shadow price reflects which of the following in a maximization problem? the maximum amount that you would be willing to pay for subtracting 1 additional unit of a scarce resource. . the marginal cost of buying additional units of a scarce resource. . the marginal gain of selling additional units of a scarce resource. D. the maximum amount that you would be willing to pay for adding 1 additional unit of a scarce resource.49. Which of the following statements is FALSE? . An infeasible solution violates all constraints. . An optimal solution can be found at a corner point of the area of feasible product combinations. . A feasible solution satisfies all constraints. D) An optimal solution satisfies all constraints. . The condition of infeasibility occurs when a. one of the decision variables is negative at the optimal solution. b. there are one or more constraints which do not affect the solution. c. there is no solution that satisfies all the constraints. d. the objective value can be made infinitely large without violating any of the problem's constraints