| 线性规划对偶单纯形算法的改进 |
| |
| 引用本文： | 郭淑娟,涂庆伟,徐惠益.线性规划对偶单纯形算法的改进[J].江苏工业学院学报,2006,18(3):46-48. |
| |
| 作者姓名： | 郭淑娟 涂庆伟 徐惠益 |
| |
| 作者单位： | [1]江苏工业学院信息科学系,江苏常州213164 [2]常州信息职业技术学院,江苏常州213164 |
| |
| 摘 要： | 运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。为了提高迭代效率，引入了最好主元素的概念，提出了对偶单纯形改进算法，由于同时考虑了Bland法则，该方法还可以避免循环。
|
| 关 键 词： | 线性规划 对偶单纯形法 对偶单纯形最好主元素 迭代 |
| 文章编号： | 1005-8893(2006)03-0046-03 |
| 收稿时间： | 2005-12-02 |
| 修稿时间： | 2005年12月2日 |
Improvement on the Dual Simplex Method about Linear Programming |
| |
| GUO Shu-juan,TU Qing-wei,XU Hui-yi.Improvement on the Dual Simplex Method about Linear Programming[J].Journal of Jiangsu Polytechnic University,2006,18(3):46-48. |
| |
| Authors: | GUO Shu-juan TU Qing-wei XU Hui-yi |
| |
| Affiliation: | Department of Information Science, Jiangsu Polytechnic University, Changzhou 213164, China |
| |
| Abstract: | Based on the principle of the dual simplex method about linear programming, the changes of the value of the objective function in iterations have been studied. To raise the effect of the iteration, the best pivot of the dual simplex method is put forward, and the improvement on the dual simplex method is given. To avoid cycling, Bland Rule should be used. |
| |
| Keywords: | linear programming dual simplex method the best pivot of the dual simplex method iteration |
| 本文献已被 维普 万方数据 等数据库收录！ |
