| 求解线性规划的快速换基迭代法 |
| |
| 引用本文： | 左光纪.求解线性规划的快速换基迭代法[J].运筹与管理,2000,9(4):9-15. |
| |
| 作者姓名： | 左光纪 |
| |
| 作者单位： | 青海民族学院应用数学系，青海西宁810007 |
| |
| 摘 要： | 本文根据目标函数最速下降原理，改进了单纯形方法的换基迭代，以尽快得到线性规划问题的最优基，该方法还可用于运输问题的表上作业和图上作业。
|
| 关 键 词： | 线性规划 单纯形法 换基 迭代 |
An Iteration Method of Quick Transformation Basis to Sovle Linear Programming |
| |
| ZUO Guang,ji.An Iteration Method of Quick Transformation Basis to Sovle Linear Programming[J].Operations Research and Management Science,2000,9(4):9-15. |
| |
| Authors: | ZUO Guang ji |
| |
| Abstract: | In this paper, the auther improves transformation basis iteration of siplex method by fast descend principle of objective function, and quickly derives the optimal base of linear programming problem. This method also has been applied to table or graphic algorithm of transportation problem. |
| |
| Keywords: | linear programming simplex method transformation basD |
| 本文献已被 CNKI 维普 等数据库收录！ |
