| 线性规划问题解法比较 |
| |
| 引用本文： | 罗会兰.线性规划问题解法比较[J].邵阳高等专科学校学报,1998(2). |
| |
| 作者姓名： | 罗会兰 |
| |
| 作者单位： | 邵阳高专 邵阳422004 |
| |
| 摘 要： | 给出单纯形法、大M法、对偶单纯形法适应的线性规划问题的特征,并给出相应解法的一般规律.
|
| 关 键 词： | 大M法 单纯形法 对偶单纯形法 比较 |
The Coparison Among the Solutions to the Problem of Linear Programming |
| |
| Luo Huilan.The Coparison Among the Solutions to the Problem of Linear Programming[J].Journal of Shaoyang College,1998(2). |
| |
| Authors: | Luo Huilan |
| |
| Abstract: | In this paper the specialities of linear programming that is suited to
the simplex,large M and dual simplex along with the general corresponding solutions
to them are given. |
| |
| Keywords: | large M simplex dual simplex comparison |
| 本文献已被 CNKI 等数据库收录！ |
