An Extended Simplex Algorithm for Linear Programming

Simplex method is one of the most useful methods to solve linear program. However, before using the simplex method, it is required to have a base feasible solution of linear program and the linear program is changed to thetypical form. Although there are some methods to gain the base feasible solution of linear program, artificial variablesare added and the times of calculating are increased with these calculations. In this paper, an extended algorithm of the simplex algorithm is established, the definition of feasible solution in the new algorithm is expended, the test number is not the same sign in the process of finding problem solution. Explained the principle of the new algorithm and showed results of LP problems calculated by the new algorithm.