Analyzing the Characteristic of Simplex Algorithm

Abstract

Simplex algorithm is a kind of iterated algorithm which is used to solve linear programming problems. It is raised by George Dantzig in 1974 and is still a valid tool especially when the scale of problem is relatively small or secondary. Simplex algorithm starts at an initializing feasible solution, and constantly approach to the optimal solution until the optimal solution is found or unbounded. Serving as a classical algorithm solving linear programming problem, it plays an important role in both theoretical. With the continuous development of computing technology, the simplex method and its varieties will continue in optimization. This research aims to help people make better decisions in optimization problems by summarizing the formula, characteristics and problem solutions of simplex algorithm. The summary is come from existing literature and including the condition of using simplex algorithm, all kind of different solutions, an example of simplex tableau method and the future of simplex algorithm.