For a linear programming problem, assume that a given resource has not been fully used. We can conclude that the shadow price associated with that constraint:
A) will have a positive value.
B) will have a negative value.
C) will have a value of zero.
D) could have a positive, negative or a value of zero. (no sign restrictions).
Answer: C
Business