Simplex

Implementation of naive and revised simplex algorithm applied to linear programming problems. Simple linear programming problem of: $$\min {\mathbf{c}'\mathbf{x}| \mathbf{Ax \leq b}, \mathbf{x} \geq 0 }$$ where $$A \in \mathbb{R}^{m \times n}, b\in \mathbb{R}^{m}, c\in \mathbb{R}^{n} \geq 0$$

The LP problem can be converted into standard form LP by introducing slack variable $$\mathbf{s}$$.