| 避免引入人工变量求线性规划可行基的一个新方法 |
| |
| 引用本文： | 梁平,张相斌,王海娇,阎楠.避免引入人工变量求线性规划可行基的一个新方法[J].数学的实践与认识,2009,39(10). |
| |
| 作者姓名： | 梁平 张相斌 王海娇 阎楠 |
| |
| 作者单位： | 1. 大连大学,数学系,辽宁,大连,116622
2. 南京邮电大学,经济与管理学院,江苏,南京,210046 |
| |
| 摘 要： | 讨论了线性规划的单纯形解法,给出了不须加人工变量就可得到一个可行基的算法.通过大量的算例表明此法比传统的单纯形方法具有算法结构简单,计算量小的优点.
|
| 关 键 词： | 线性规划 单纯形法 可行基 人工变量 |
A new Method of Avoiding Artificial Variables for Achieving an Initial Feasible Basis of a Linear Programming |
| |
| LIANG Ping,ZHANG Xiang-bin,WANG Hai-jiao,YAN Nan.A new Method of Avoiding Artificial Variables for Achieving an Initial Feasible Basis of a Linear Programming[J].Mathematics in Practice and Theory,2009,39(10). |
| |
| Authors: | LIANG Ping ZHANG Xiang-bin WANG Hai-jiao YAN Nan |
| |
| Abstract: | The simplex method is discussed in this paper, and an algorithm for achieving an initial feasible basis of a linear programming is obtained without any artificial variables. A large mount of examples demonstrate that this method has an advantage of the simple structure and little effort than traditional method. |
| |
| Keywords: | the linear programming the simplex method the feasible basis artificial variables |
| 本文献已被 万方数据 等数据库收录！ |
|
