摘要
以2003年全国大学生数学建模竞赛题“钢管订购与运输问题”为研究对象,首先研究了所给图形的性质,得到将铁路运费与销价转换为公路运费的思想,然后通过Floyed算法,求得各钢厂到各个站点的最短路。利用相关的理论构造一个规划问题,从而得到相应的优化模型,利用LINGO软件求解。特别地对于问题(2),用规划论中的灵敏度分析可得到所需之结论。问题(3)中的树形图情形先解决其分支部分,再考虑它的主干部分,这样能使问题得到较好的解决。
Based on an undergraduate mathematical modelling contest problem in 2003, we study the property of the given graph of the problem at first. Then we find an effective idea of changing the railway freight and the sale price into the highway freight. Using Floyed algorithm, we get the shortest way from each steel factory to each station. By related theories, we construct a mathematical programming problem and get a model of optimization. Through the software Lingo, the problem is solved. Specially for the problem Ⅱ, we get the results by the sensitivity analysis of programming theory. For problem Ⅲ, we firstly consider the offset of the graph, then think about the main part. So the practical problem is solved very well.
出处
《常熟理工学院学报》
2006年第4期37-40,共4页
Journal of Changshu Institute of Technology
