Which of the following statements about linear programming is FALSE?

Select one:

a. A redundant constraint is also a non-binding constraint.

b. A difference between minimization and maximization problems is that minimization problems often have unbounded regions.

c. In sensitivity analysis of LP problem, if the resource has been used up, the shadow price would be non-zero.

d. If the change of the objective coefficient is out of the range of optimality, the optimal solution in terms of decision variables will usually change.

e. If the RHS of a constraint changes in a profit maximization problem, the iso-profit line will change as well.