| 线性规划问题新解——改进大M法 |
| |
| 引用本文： | 王岚,李彦翔,靳松.线性规划问题新解——改进大M法[J].后勤工程学院学报,2011,27(3):92-96. |
| |
| 作者姓名： | 王岚 李彦翔 靳松 |
| |
| 作者单位： | 1. 武警沈阳指挥学院教研部,沈阳,110113
2. 后勤指挥学院编研室,北京,100858 |
| |
| 摘 要： | 借鉴两阶段法的求解思路,在用单纯形法求解线性规划问题时,对大M法进行改进,提出一种新的算法.这种改进后的算法可以有效克服原来两种算法的不足,既能降低理解难度,又能提高算法的效率,保证算法的全局收敛性.
|
| 关 键 词： | 线性规划 单纯形法 大M法 两阶段法 |
A New Algorithm for Linear Programming-Improved Big-M Method |
| |
| WANG Lan,LI Yan-xiang,JIN Song.A New Algorithm for Linear Programming-Improved Big-M Method[J].Journal of Logistical Engineering University,2011,27(3):92-96. |
| |
| Authors: | WANG Lan LI Yan-xiang JIN Song |
| |
| Institution: | 1.Shenyang Command College of the Chinese Armed Police Forces,Shengang 110113,China;2.The Logistics Command Academy,Beijing 100858,China) |
| |
| Abstract: | Referring to the two-phase solving method,the big-M method is improved by solving linear programming problems using the simplex method,and a new algorithm is presented.The improved algorithm can effectively overcome the lack of the two original algorithms,and not only reduce the difficulty of understanding,but also improve the efficiency of the algorithm to ensure global convergence of the algorithm. |
| |
| Keywords: | linear programming simplex method big-M method two-phase method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
