|
| 摘要: |
| 提出了一种在不引入人工变量的情况下，寻求线性规划初始基可行解的方法，与传统的两阶段法相比，具有计算量小且占有存储空间少的特点，对两阶段法第一阶段问题作了改进。 |
| 关键词: 线性规划 两阶段法 人工变量 初始基可行解 |
| DOI： |
| 分类号:O221.1 |
| 基金项目: |
|
| A method for seeking initial basic feasible solution of linear programming problem |
|
范国兵' target='_blank'>FAN Guo-bing
|
| Abstract: |
| This paper presents a method for seeking initial basic feasible solution of linear programming problem without using artificial variable, comparing with traditional two -stage way,it has low computation amount and needs less memory cells for computing, so |
| Key words: linear programming two -stage way artificial variable initial basic feasible solution |
