2
In simplex algorithm, in order to handle inequation constraints, we need to convert them into equations by introducing so-called 'slack variables', like
$$
\mathbf{a}^T\mathbf{x} + b \leq 0\quad\rightarrow\quad \mathbf{a}^T\mathbf{x} + b + s = 0
$$
On the other hand, if some constraints could be ...