| 一种求线性规划问题初始基可行解的方法 |
| |
| 引用本文： | 范国兵. 一种求线性规划问题初始基可行解的方法[J]. 重庆工商大学学报(自然科学版), 2007, 24(3): 234-236 |
| |
| 作者姓名： | 范国兵 |
| |
| 作者单位： | 湖南财经高等专科学校,基础课部,湖南,长沙410205 |
| |
| 摘 要： | 提出了一种在不引入人工变量的情况下，寻求线性规划初始基可行解的方法，与传统的两阶段法相比，具有计算量小且占有存储空间少的特点，对两阶段法第一阶段问题作了改进。
|
| 关 键 词： | 线性规划 两阶段法 人工变量 初始基可行解 |
| 文章编号： | 1672-058X（2007）03-0234-03 |
| 收稿时间： | 2006-11-02 |
| 修稿时间： | 2006-11-022007-03-19 |
A method for seeking initial basic feasible solution of linear programming problem |
| |
| FAN Guo-bing. A method for seeking initial basic feasible solution of linear programming problem[J]. Journal of Chongqing Technology and Business University:Natural Science Edition, 2007, 24(3): 234-236 |
| |
| Authors: | FAN Guo-bing |
| |
| Affiliation: | Department of Basic Knowledge Teaching, Hunan College of Finance and Economics, Hunan Changsha 410205,China |
| |
| 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 it is an improved two - stage way of the first period question. |
| |
| Keywords: | linear programming two -stage way artificial variable initial basic feasible solution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆工商大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《重庆工商大学学报(自然科学版)》下载全文 |
