| 单纯形方法中转轴运算的新法则 |
| |
| 引用本文： | 卢新明,高自友. 单纯形方法中转轴运算的新法则[J]. 山东科技大学学报(自然科学版), 1990, 0(2) |
| |
| 作者姓名： | 卢新明 高自友 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系，山东矿业学院应用数学与软件工程系 |
| |
| 摘 要： | 本文借助于一类有向图中最短路的直观特征与单纯形方法的理论分析,在求解线性规划的单纯形方法中,给出了一个新的转轴法则。新法则不但能减少迭代步数,而且能消除己知的指数算例。同时也得到了Karmarkar算法与其它算法无法比拟的实验结果。
|
| 关 键 词： | 线性规划 退化 有向图 |
A NEW PIVOTING RULE FOR THE SIMPLEX METHOD |
| |
| Xinming Gao Ziyou. A NEW PIVOTING RULE FOR THE SIMPLEX METHOD[J]. Journal of Shandong Univ of Sci and Technol: Nat Sci, 1990, 0(2) |
| |
| Authors: | Xinming Gao Ziyou |
| |
| Affiliation: | Dep. of APPlied Math. and Soft Eng. |
| |
| Abstract: | This paper, with the help of the directly perceivable characteristic of the shortest route for some class of a directed graph and the theoretical analysis of the simplex method, presents a new pivoting rule for solving linear programming. The new rule can decrease the number of iterations and eliminate some known exponential calculation examples, meanwhile, the practical results with which karmarkar's method and other method cannot be compared are obtained |
| |
| Keywords: | Linear Programming Degeneracy Directed Graph |
| 本文献已被 CNKI 等数据库收录！ |
