一种求线性规划问题初始基可行解的方法  

A method for seeking initial basic feasible solution of linear programming problem

作　　者：范国兵[1] 

机构地区：[1]湖南财经高等专科学校基础课部,湖南长沙410205

出　　处：《重庆工商大学学报（自然科学版）》2007年第3期234-236,共3页Journal of Chongqing Technology and Business University:Natural Science Edition

摘　　要：提出了一种在不引入人工变量的情况下,寻求线性规划初始基可行解的方法,与传统的两阶段法相比,具有计算量小且占有存储空间少的特点,对两阶段法第一阶段问题作了改进.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.

关 键 词：线性规划 两阶段法 人工变量 初始基可行解 

分 类 号：O221.1[理学—运筹学与控制论]