摘要
本文先利用问题一中铺设线路无分岔的特点 ,建立了基于图解法的最小面积模型 ,将规划问题转化为使若干折线段下方面积和最小的问题 ,通过简单的判别准则 ,手工求得最小总费用为 1 2 78631 .6万元 ,并对该结果最优性进行了说明 .对问题三参考网络流思想建立了适用于一般铺设路线的非线性规划模型 ,用SAS得到一个最优方案和最小费用 1 4 0 6631 .4万元 ,并用此模型对问题一的灵敏度进行了准确的定量分析 .
We succeeded in drawing up an optimal plan for the order and transportation of pipelines by establishing two models.A diagrammatic model is set up for the first problem in which there is no branch in the track of pipelines.Solution of the problem is then equivalentto the plan thatminimizes some area of a special diagram.The idea of flow in network helps to set up a non- linear programming model for the lastproblem where the track is a tree diagram.The regular form of the model makes it convenient to find the solution by The SAS System.The model is also used to give an accurate sensitivity analysis for the first problem.
出处
《数学的实践与认识》
CSCD
北大核心
2001年第1期83-87,共5页
Mathematics in Practice and Theory
