In a LPP, the linear inequalities or restrictions on the variables called.

Explanation

**Step-by-Step Solution:**

1. **Understanding Linear Programming Problem (LPP)**:
- A Linear Programming Problem is a mathematical method used for optimizing a linear objective function, subject to linear equality and inequality constraints.

2. **Identifying Components of LPP**:
- In an LPP, there are typically three main components:
- The objective function: This is what we want to maximize or minimize.
- The decision variables: These are the variables that will be adjusted to achieve the objective.
- The constraints: These are the restrictions or limitations placed on the decision variables.

3. **Defining Constraints**:
- The linear inequalities or restrictions on the decision variables are known as constraints. They define the feasible region within which the solution must lie.

4. **Conclusion**:
- Therefore, in a Linear Programming Problem, the linear inequalities or restrictions on the variables are called **constraints**.

---