The activities or limitations competing with one another to share the amount of resources in linear programming are called:

In Linear Programming:Decision Variables represent the levels of activity ($x,y,z$). They are the variables that "compete" for resources.Objective Function is the mathematical expression to be maximized or minimized.Constraints are the actual mathematical limits on the resources.Based on the definition of "activities... competing with one another," these are Decision Variables.