1. **State the problem:** Identify which of the given constraints is NOT a type of constraint in Linear Programming Problems (LPP). 2. **Recall types of constraints in LPP:** - LPP constraints are linear inequalities or equalities involving variables. - Common forms include: - \(ax + by \leq c\) - \(ax + by \geq c\) - \(ax + by = c\) - Variables often have non-negativity constraints like \(x \geq 0\). 3. **Analyze each constraint:** - \(x + y \leq 5\): linear inequality, valid LPP constraint. - \(2x - 3y \geq 10\): linear inequality, valid LPP constraint. - \(x^2 + y^2 = 25\): quadratic equality, NOT linear, so NOT a valid LPP constraint. - \(x \geq 0\): non-negativity constraint, valid in LPP. 4. **Conclusion:** The constraint \(x^2 + y^2 = 25\) is NOT a type of constraint in LPP because it is nonlinear. **Final answer:** \(x^2 + y^2 = 25\) is NOT a type of constraint in LPP.