| 全方位搜索的亚基迭代算法 |
| |
| 引用本文： | 郭强.全方位搜索的亚基迭代算法[J].运筹与管理,1999,8(1):34-40. |
| |
| 作者姓名： | 郭强 |
| |
| 作者单位： | 西北建筑工程学院基础科学系 |
| |
| 摘 要： | 文章改进了单纯形算法中的进基规则和迭代方式，与原始单纯形算法相比，能够有效地减少迭代次数，提高计算速度
|
| 关 键 词： | 线性规划 单纯形算法 基本可行解 最优解 |
Meta Basis Iteration Method with All Direction Search |
| |
| Guo,Qiang.Meta Basis Iteration Method with All Direction Search[J].Operations Research and Management Science,1999,8(1):34-40. |
| |
| Authors: | Guo Qiang |
| |
| Abstract: | The rule of entering basis and the iteration method of simplex algorithm are improved in this paper,so the number of iteration is decreased,and the speed of computation is raised compared with original simplex algorithm. |
| |
| Keywords: | linear programming simplex algorithm basic feasible solution optimal solution |
| 本文献已被 CNKI 维普 等数据库收录！ |
