江汉大学学报（自然科学版）Issue(5)：31-34,4.
关于“线性规划的符号跟踪算法”的注记
Note on Symbol Tracking Algorithm of Linear Programming
摘要
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.关键词
线性规划/基本解/单纯形算法/对偶单纯形算法/符号跟踪算法Key words
linear programming/basic solution/simplex algorithm/dual simplex algorithm/symbols tracking algorithm分类
数理科学引用本文复制引用
唐沧新,高培旺..关于“线性规划的符号跟踪算法”的注记[J].江汉大学学报（自然科学版）,2013,(5):31-34,4.基金项目
广西自然科学基金资助课题（桂科自0728260）；广西财经学院科研项目 （）
