I have coded recently the simplex algorithm. It is an algorithm that solves the optimizations of a problem of linear programming. It gives a function to minimize and constrains the variables with an inequality form.

It can be proven that the simplex algorithm solves this problem in Non-Polynomial time.