求解线性规划的单纯形法的直接方法  

Direct way of simplex method for solving linear programming model

作　　者：申卯兴[1] 许进[1] 

机构地区：[1]华中科技大学控制科学与工程系

出　　处：《计算机工程与应用》2007年第30期94-96,共3页Computer Engineering and Applications

基　　金：国家高等学校骨干教师计划(No.GG-1105-90039-1004)

摘　　要：通过对单纯形求解法的实质的分析和认识,提出了基于矩阵初等变换初始可行基的获得方法,进而得到基于单纯形法的求解线性规划模型的直接方法,省略了以往为选择解法而进行的分析判断,使单纯形法的运用简便明了。An association between the elementary transformation of matrix and the concept of initial feasible basis is established, and then, a determination way for initial feasible basis of linear programming is presented.A direct way of the simplex method for solving a linear programming problem is presented,this scheme is concisely,convenience and making the solving procedure clearly in practice.Some examples are given to demonstrate these good characteristics.

关 键 词：线性规划 初始可行基 初等行变换 单纯形法 

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