Revised Simplex method

This is an implementation of the Revised Simplex Method for linear programs.

This method print the iteration, actual base, number of variables in the base,the columns outside the basis. and the reduced cost. Theoreticaly it should work with degenerate basi solutions.
It do not work with games theory problens
There are 3 cases. if the problem is with <= constrains, the boolean variables are menorigual=1, igual=0 and A and C should consider the slack variables. if the problem is with = constrains, then the boolean variables are menorigual=0, igual=1. if the problem is with >= constrains, the boolean variables are menorigual=0, igual=0. A and C should consider the surplus variables