线性规划模型的一种表上矩形作业法  

A Rectangular Operation Method Expressed in Simplex Table for Linear Programming Model

作　　者：王继顺[1] 王传斌[1] 

机构地区：[1]连云港师范高等专科学校数学与应用数学系,江苏连云港222006

出　　处：《淮北煤炭师范学院学报（自然科学版）》2010年第3期14-18,共5页Journal of Huaibei Coal Industry Teachers College(Natural Science edition)

基　　金：连云港师范高等专科学校首批"青蓝工程"人才项目资助;连云港师专科技创新团队课程资助项目(LSZTD200703)

摘　　要：线性规划模型的成熟算法是单纯形法.在单纯形法的基础上,提出一种表上矩形作业法.该方法在简化的单纯形表上,首先确定以枢元及需要更新元素为对角构成的矩形,然后通过矩形顶点元素的运算求得更新元素值,以此求出所有的非枢轴元,进而求得枢轴元和枢元,得出新的单纯形表.例子说明方法形象直观,求解过程简捷有效.The simplex method is a matural algorithm for the linear programming model.Based on the simplex method,a rectangular operation method expressed in tables of the linear programming problem is presented.In the reduced initial simplex table,The method first determines a rectangle which one vertex is the pivot element and the other opposite vertex is the element needs to be renew,the renewal element then will be obtained through the rectangular apex element operation.According the method,all the elements not on the pivotal line can be renewed.A new simplex table will be obtained after the pivotal elements and the pivot element being renewed at last.The developed method makes the operation visual and intuitionistic.The examples show that this algorithm is concise and effective in seeking solution to the linear programming problem.

关 键 词：线性规划模型 单纯形表 单纯形法 表上矩形作业法 

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