| 规范形式LP问题的改进对偶单纯形法 |
| |
| 引用本文： | 张劲松,赵冬梅.规范形式LP问题的改进对偶单纯形法[J].重庆工学院学报,2007,21(3):100-102. |
| |
| 作者姓名： | 张劲松 赵冬梅 |
| |
| 作者单位： | 九江学院理学院 江西九江332005(张劲松)，北京丰台王佐学校 北京100074(赵冬梅) |
| |
| 摘 要： | 通过分析对偶单纯形法迭代的实质,就所给LP问题的规范形式,不引进剩余变量而直接得出另一种改进的对偶单纯形法,使变量个数不增且运算规模缩小.
|
| 关 键 词： | LP问题 规范形式 对偶单纯形法 |
| 文章编号： | 1671-0924(2007)03-0100-03 |
| 修稿时间： | 2006年12月29日 |
Improved Dual Simplex Algorithm on Linear Programming with Normal Form |
| |
| ZHANG Jin-song,ZHAO Dong-mei.Improved Dual Simplex Algorithm on Linear Programming with Normal Form[J].Journal of Chongqing Institute of Technology,2007,21(3):100-102. |
| |
| Authors: | ZHANG Jin-song ZHAO Dong-mei |
| |
| Affiliation: | ZHANG Jin-song1,ZHAO Dong-mei2 |
| |
| Abstract: | 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. |
| |
| Keywords: | Linear Programming problem normal form dual simplex algorithm |
| 本文献已被 CNKI 等数据库收录！ |
