Revised Simplex Method.

The function revised solves an LPP using revised simplex method. It uses big M method.

This function is able to detect almost all types of properties/characteristics present in an LPP such as unbounded solution, alternate optima, degenaracy/cycling and infeasibilty. It only fails to work when there are redundant constraints present in the problem. However, it is rare and can be easily avoided by the user by just checking/ensuring that rank(a) should not be less than the number of constraints. As finding rank of big matrices has high complexity, this check has not been given here and it is expected that user would take care of such cases. In such cases usually it is easily seen that some constraints are linearly dependent and hence can be eliminated. Rest of the cases show good results. For theory of Revised Simplex method and LPP
one may see "Numerical Optimization with Applications, Chandra S., Jayadeva, Mehra A., Alpha Science Internatinal Ltd, 2009."