徐州工程学院学报：自然科学版2012，Vol.27Issue(2)：1-4,4.
关于求线性规划初始正则解的一个新方法的注记
A Note on a New Method Regular Solution of for Achieving an Initial a Linear Program
摘要
Abstract
Linear optimization has been widely used in the various areas of economics and management. In the case of filling the basic variables with negative values in solving a linear programming problem, Liang presented a new method for achieving an initial regular solution to the problem. This paper further discusses the essence of the method and finds out that the method consists of two phases. In phase 1, a nonnegative right-hand side vector is introduced to construct an auxiliary problem, which can generate a regular solution （if any） to the original problem by the primal simplex algorithm. Phase 2 applies the dual simplex algorithm to obtain the optimal solution （if any） starting from the regular solution. Furthermore, a numerical test on some large-scale instances from NETLIB is performed, and the results show that the method needs a great computational effort. Therefore, the paper presents an improvement of the method.关键词
线性规划/基本可行解/初始正则解/单纯形法/对偶单纯形法Key words
linear programming/basic feasible solution/initial regular solution/simplex algorithm/dual simplex algorithm分类
数理科学引用本文复制引用
高培旺..关于求线性规划初始正则解的一个新方法的注记[J].徐州工程学院学报：自然科学版,2012,27(2):1-4,4.基金项目
基金项目：广西自然科学基金项目 （）
