A variant of Karmarkar's modified algorithm is given for solving Karmarkar's standard linear programming with unknown optimal objective value. By using LDL^T factorization of bordering matrix and modified matrix，an efficient method is given. Finally，convergence and complexity of the algorithm are given theoretically.