线性规划问题的一种改进的单纯形法  

An Improved Simplex Method for Linear Programming

作　　者：范国兵[1] 

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

出　　处：《海南大学学报（自然科学版）》2007年第3期243-247,共5页Natural Science Journal of Hainan University

摘　　要：提出了一种求解线性规划问题的方法,即对约束Ax=b求初始基可行解时,不必引入人工变量而直接用旋转运算获得,之后利用传统单纯形法求最优解,并给出了该方法的实算例子.A kind of improved simplex method for searching solutions to linear programming is presented, that is, for the condition restriction Ax = b, a viable solution for initial radix can be directly obtained by circumvolve operation without introducing artificial variable. And then an optimization solution is got using traditional simplex method. A criterion about existence of the feasible solution and several examples of the algorithm are presented in this paper.

关 键 词：线性规划 单纯形法 基可行解 人工变量 

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