摘要
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.
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.
出处
《计算数学》
CSCD
北大核心
1999年第4期441-450,共10页
Mathematica Numerica Sinica
基金
湖南省自然科学基金!97JJN-065
关键词
线性规划
基点
基线
最好主元
算法
单纯形法
Linear programming, Co-optimal face, Basic point, Basicline, The best pivot
