If m is the number of constraints in a linear programming with two variables x and y and non – negative constraints x ≥
Let's break it down: complete solution: write formula, plug data, do arithmetic. Final value matches m + 2. Simple and accurate.
Ref: NCERT Mathematics Class XII — Linear Programming
