文献类型：期刊文章

作　　者：阮国桢[1]

机构地区：[1]湘潭大学数学系

出　　处：《计算数学》

基　　金：湖南省自然科学基金!97JJN-065

年　　份：1999

卷　　号：21

期　　号：4

起止页码：441-450

语　　种：中文

收录情况：BDHX、BDHX1996、CSCD、CSCD2011_2012、INSPEC、JST、MR、ZGKJHX、ZMATH、核心刊

摘　　要：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.

关 键 词：线性规划 基点 基线 最好主元  算法  单纯形法

分 类 号：O221.1]