线性规划基线算法的基本概念

The basic line algorithm is a development of the simplex method (a basic pointmethod). As every operational table (BL-tableau) corresponds to a basic line, itis so called. This algorithm is as easy as the simplex method for learning andoperating and faster than the simplex method to solve problem. It is a group ofmethod. Because of selecting pivot with different way we can obtain variant basicline method. In this paper, we give the idea of the basic line algorithm and discussthe best pivot method. Theoretically, this method is faster one degree of quantitythan the simplex method to solve problem.