规范形式LP问题的改进对偶单纯形法

Improved Dual Simplex Algorithm on Linear Programming with Normal Form

通过分析对偶单纯形法迭代的实质,就所给LP问题的规范形式,不引进剩余变量而直接得出另一种改进的对偶单纯形法,使变量个数不增且运算规模缩小.

By analyzing the essence of iteration on the dual simplex algorithm and based on Linear Programming with normal form, this paper gains another improved dual simplex algorithm without bringing in surplus variables, which results in the same number of variables and reduced operational size.