| 关于“线性规划的符号跟踪算法”的注记 |
| |
| 引用本文： | 唐沧新,高培旺.关于“线性规划的符号跟踪算法”的注记[J].江汉大学学报(自然科学版),2013(5):31-34. |
| |
| 作者姓名： | 唐沧新 高培旺 |
| |
| 作者单位： | [1]广西财经学院信息与统计学院,广西南宁530003 [2]闽江学院数学系,福建福州350121 |
| |
| 基金项目： | 广西自然科学基金资助课题（桂科自0728260）;广西财经学院科研项目（2010C05） |
| |
| 摘 要： | 指出“线性规划的符号跟踪算法”实际上是第一阶段单纯形算法的一种变式，所获得的初始基有4种可能情况，并通过反例进行了说明。由此初始基出发，为使符号跟踪算法能正常运行下去，对该算法的步骤作了修正和补充。为了进一步验证符号跟踪算法的计算性能，通过MATLAB编程在计算机上实现大规模数值试验。结果表明，与经典单纯形算法相比，符号跟踪算法平均每次迭代花费更多的执行时间，计算效率较低。
|
| 关 键 词： | 线性规划 基本解 单纯形算法 对偶单纯形算法 符号跟踪算法 |
Note on Symbol Tracking Algorithm of Linear Programming |
| |
| TANG Cang-xin,GAO Pei-wang.Note on Symbol Tracking Algorithm of Linear Programming[J].Journal of Jianghan University:Natural Sciences,2013(5):31-34. |
| |
| Authors: | TANG Cang-xin GAO Pei-wang |
| |
| Institution: | 1.School of Information and Statistics, Guangxi University of Finance and Economics, Nanning 530003 2.Department of Mathematics, Minjiang University, Fuzhou 350121, Fujian, China) |
| |
| Abstract: | Points out the symbol tracking algorithm of linear programming in fact is a variant of the first stage simplex algorithm, the obtained basis has four possibilities, and illustrates with counter-examples. Beginning with the initial basis, for the normal running of symbol tracking algo- rithm, verifies and complements the steps of the algorithm. To further test the computational perfor- mance of symbol tracking algorithm, carries on big scale numerical test with MATLAB programming on computer. The results show that the symbol tracking algorithm averagely spends more executive time for each iteration and the computing efficiency is lower compared to the classical simplex algo- rithm. |
| |
| Keywords: | linear programming basic solution simplex algorithm dual simplex algorithm symbols tracking algorithm |
| 本文献已被 维普 等数据库收录！ |
