The Karmarkar algorithm and its modifications are studied in this thesis. A modified line search algorithm with extended searching bound to the facet of the simplex is developed and implemented. Using this modification, a modified row partition method is tested. Both algorithms are coded in Fortran 77 and compared their performances with the original Karmarkar algorithm. The modifications are promising and other extensions are encouraged.Computing and Information Scienc