| 线性规划最好主元法的实验报告 |
| |
| 引用本文： | 孟志清,江河.线性规划最好主元法的实验报告[J].湘潭大学自然科学学报,1997,19(4):113-116. |
| |
| 作者姓名： | 孟志清 江河 |
| |
| 作者单位： | 湘潭大学计算机科学系，湘潭大学数学系!湘潭，41105，湘潭大学数学系!湘潭，41105 |
| |
| 摘 要： | 该文对求解线性规划一种新的快速算法，称为最好主元法，在计算机上通过了数千个实例的试算表明，迭代次数不超过变量维数与约束个数之和，是一个很有价值的实用算法．
|
| 关 键 词： | 线性规划 可旋转元 软上界 硬上界 |
THE EXPERITMENT REPORT OF THE BEST PIVOT ALGORITHM FOR THE LINEAR PROGMAMMING |
| |
| Meng Zhiqing, Jiang He, Cheng Yangjin.THE EXPERITMENT REPORT OF THE BEST PIVOT ALGORITHM FOR THE LINEAR PROGMAMMING[J].Natural Science Journal of Xiangtan University,1997,19(4):113-116. |
| |
| Authors: | Meng Zhiqing Jiang He Cheng Yangjin |
| |
| Abstract: | This paper,we present a userful and fast new algorithm for the linear programming. We have solved the linear programming problem about three thousands by using thisnew algorithm,the results show the number of polynomial. The algorithm is more simple andeffcient than the simplex algorithm. It is very valuable. |
| |
| Keywords: | Linear programming pivotable soft upper bounded hard upper bounded |
| 本文献已被 CNKI 维普 等数据库收录！ |
