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:
1) will have a positive value
2) will have a negative value
3) will have a value of zero
4) could have a positive, negative or a value of zero. (no sign restrictions)