论文部分内容阅读
提出了战时装备保障运输问题。这一新的问题是在一般运输问题的基础上 ,对运量增加了上、下界限制而得到的。对于该问题 ,一般的做法是将其化为具有上下界限制的线性规划问题采用一般线性规划问题求解方法 ,则使问题规模扩大 2倍。本文针对这一新的问题建立了数学模型 ,根据这一类问题的特征给出了一个新的对偶算法。根据这一新的算法可以对原有运输问题采用表上作业法进行计算 ,同时 ,在运量发生变化的情况下 ,能够对原预案进行快速有效地调整 ,从而节省了运算时间。
Proposed wartime equipment to protect transport problems. This new issue is based on the general transport problem, which adds to the limits of upper and lower bounds on traffic volume. For this problem, the general approach is to transform it into a linear programming problem with upper and lower bound limits. By adopting a general linear programming problem solving method, the scale of the problem is enlarged by two times. In this paper, we establish a mathematical model for this new problem, and give a new dual algorithm according to the characteristics of this kind of problem. According to this new algorithm, the original transportation problem can be calculated by the on-the-job method. In the meantime, when the traffic volume changes, the original plan can be adjusted quickly and effectively, which saves the computing time.