In linear programming, if there are three constraints, each representing a resource that can be used up, the optimal solution must use up all of each of the three resources.

The optimal solution may or may not use up all of each of the three resources, depending on the problem's objective function and coefficients. It is possible for there to be slack or surplus variables indicating that not all of the resources are used up at the optimal solution.