对一种线性规划新算法及其改进算法的修正与改进

Adaptations and Modifications on A New Algorithm for Linear Programming and Its First Modifications

通过对一种线性规划新算法具体执行过程中的一些关键环节进行分析,证明了边界面上可行方向的充分必要条件,指出了这种算法及其改进算法执行过程中可能遇到的问题,并在此基础上结合核心算法线性规划问题解的特点对算法过程进行了改进修正,使得改进后的算法更合理,更完善.

In this paper, some important joints implemented in a new algorithm for linear programming are discussed in details, a necessary and sufficient condition on the feasibility of a important direction is proved and thus some flaws and troubles on them are presented. Based on these and combined the special property of solutions of linear programming , some adaptations and modifications are offered , which make the original algorithm and its first modifications more reasonable and executable. Furthermore, a new algorithm that is able to deal with the largescale linear programming is built up by a substitute for the core of the original algorithm that is also given in this pa-per.