Abstract: Points out the symbol tracking algorithm of linear programming in fact is a variant of the first stage simplex algorithm，the obtained basis has four possibilities，and illustrates with counter-examples. Beginning with the initial basis，for the normal running of symbol tracking algorithm，verifies and complements the steps of the algorithm. To further test the computational performance of symbol tracking algorithm，carries on big scale numerical test with MATLAB programming on computer. The results show that the symbol tracking algorithm averagely spends more executive time for each iteration and the computing efficiency is lower compared to the classical simplex algorithm.

Key words: linear programming, basic solution, simplex algorithm, dual simplex algorithm, symbols tracking algorithm