摘要
文[2]通过两个反例的计算,认为文[1]所提出的求LP可行基的方法有不妥之处,并对[1]的方法中主要步骤作了修正。本文对[1]的算法中轴心项的选取作进一步说明,对[2]中所提出的反例以[1]中算法进行计算与[2]对比分析,说明[2]中的反例并不成立。
In paper[2], the author finds the algorithm "A Method to Solve the Feasible Basis of LP " in paper[ 1 ] somewhat inappropriate, by giving two opposite examples. And it also "corrects" the main step in the algorithm mentioned. This paper gives a further explanation of the paper [ 1 ]and proves the examples in [2] are untenable.
出处
《运筹与管理》
CSCD
2005年第4期52-54,共3页
Operations Research and Management Science
关键词
运筹学
可行基
旋转迭代
轴心项
operations research
feasible basis
twiddle iterative
pivot element