线性规划单纯形法的三种实现形式探析

The Three Form Tableaus of Simplex Methods Solving to the Linear Programming

按照一般寻优算法原则,在定义可行方向和步长的基础上,从线性规划问题系数矩阵的列向量子空间出发,说明了单纯形法的顶点寻优过程是一个在约束条件的仿射空间和系数矩阵的零子空间交错前进的过程,并在此基础上归纳和总结了数据字典式单纯形表、经典单纯形表和简化单纯形表的实现形式及其迭代计算的特点和优势,并建议未来在《运筹学》教学中广泛推广这三种类型的单纯形表.

Using the general processes of searching technique for optimization,the principle of the simplex method is demonstrated by the feasible direction and the optimal step size,which are key factors for optimization algorithms.It is shown that the process of extreme optimization is an alternation forward movement from the affine space of the constraints to the zero subspace of the constraint coefficient matrix in a linear programming.From this conclusion,three simplex tableaus are summarized and analyzed according to their characteristics and advantages.They are the dictionary simplex tableau,the classical simplex tableau and the simplified simplex tableau.We conclude that these three types of simplex tableaus could be integrated in the simplex method teaching practices to improve students’learning efficiency about the linear programming.