Number of equations and variables in a Linear Programming problem

Question

Why in every Linear Programming problem in standard form it's assumed that $m\leq n$ (where m are the rows and n the columns of the A matrix) ? Thanks

Answer 1

If $m>n$, it means there are redundancy in the constraints of which you can reduce the number of linear equations, hence it suffices to only focus on the case where $m \le n$.

Answer 2

Each equality constraint may be used to eliminate one variable, so the standard problem consists only of inequality constraints. Each has a slack or surplus variable added to convert it to an equality, so the number of variables n always exceeds the number of constraints m.