On the applicability of Karmarkar's algorithm

This paper presents an attempt undertaken in order to answer the question of the applicability of the Karmarkar's algorithm, based on a comparative study about efficiency and computational complexity between the Revised Simplex Method and the algorithm of Karmarkar. Problems of little dimension, without taken into account the solution parameter, were used. Some computational results are also reported.