Simplexmethod建模研讨  

Study on Simplex Method Modelling

作　　者：宋占奎[1] 

机构地区：[1]湖北十堰职业技术学院,湖北十堰442000

出　　处：《杨凌职业技术学院学报》2011年第4期22-24,28,共4页Journal of Yangling Vocational & Technical College

摘　　要：目的 Linear Programming的simplexmethod建模求最优解。方法应用simplexmethod.结果建立了LinearProgramming的数学模型并用simplexmethod求得了最优解.结论因为单纯形表反映了Linear Programming的所有信息,故用simplexmethod可简便地求得最优解.simplexmethod的基本思路是:先将Linear Programming用sim-plexmethod划为标准型,根据问题的标准型,进行初等行变换,将主元素列除主元素化为1外其余的元素均化为0,当基变量值全为非负时,问题就得到了最优解.A mathematical model of linear programming was established by using simplex method and the optimal solution was obtained.Since the simplex table reflects all information about linear programming,therefore the optimal solution can be easily obtained using simplex method.To divide the linear programming as the standard type using simplex method,according to the standard type of question,the primary line of transformation was carried out,changing into the other element equalized to 0 except the principal element 1 of the principal element row,when base variable values were all non-negative,the optimal solution to the question was obtained.

关 键 词：对偶单纯形 影子价格 标准型 基变量 初始基 迭代法 检验数 最优解 

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