运输问题表上作业法的再探讨  

Discussion on table algorithm of transport problem

作　　者：郝自军[1] 高岳林[1] 

机构地区：[1]北方民族大学信息与计算科学学院,宁夏银川750021

出　　处：《西南民族大学学报（自然科学版）》2011年第2期209-211,共3页Journal of Southwest Minzu University(Natural Science Edition)

基　　金：宁夏回族自治区精品课程<运筹学>建设项目资助;宁夏回族自治区教研教改项目资助

摘　　要：表上作业法是求解运输问题的重要方法,表上作业法的实质是单纯形法.在用表上作业法求解运输问题时,运输问题的基本性质起着非常重要的作用,这些性质也揭示了表上作业法是单纯形法的特殊情形.然而在现行教材中,对运输问题的基本性质分析不够,缺少严格的证明,这在教学中造成了很大的困惑.通过进一步分析,本文给出了用最小元素法给出的初始方案是运输问题的基可行解的一种新证明方法,并指出为什么:"每个空格都对应着唯一的闭回路";当出现退化情形时,给出了添加"0"时需要注意的问题.The table algorithm is an important solution to the transport problem, and the substance of table algorithm is simplex method. When we use table algorithm to solve transport problem, the transport problem＇s basic nature plays an important role. They reveal internal relation of table algorithm and simplex method. But in the existing materials, the analysis of the transport problem＇s basic nature is not enough, without the rigorous proof. This is the cause of great perplexity. By further analysis, a new proof is given for an important theorem-initial solution given by minimum element method is a basic feasible solution, and points out why that each blank corresponds a unique close-loop and when we meet degeneration, more cost-effective way of adding ＂0＂ is given.

关 键 词：运输问题 表上作业法 闭回路 退化 

分 类 号：O22[理学—运筹学与控制论]