带时间约束的运输问题的传统解法通常是用多目标规划法。
The traditional method for solving transportation problem with time restraint is a nonlinear multi-objective (program) method.
后者是一类非线性多目标规划问题，我们把它称为B运输问题。
The later is a nonlinear multiobjective programming, and it is called B Transportation Problem.
构造了多目标多约束水平(MC2)动态运输问题的数学模型，开发了求解这一模型的迭代算法。
In this paper, a dynamic transportation model with multiple criteria and multiple constraint levels (DMC2) is formulated. An algorithm is developed to solve such DMC2 transportation problems.
简便解法利用简单的数学方法把多目标规划法简化为单一目标，简化为传统运输问题模型。
The new method is changing a nonlinear multi-objective program to single problem with simple mathematics (method. )
简便解法利用简单的数学方法把多目标规划法简化为单一目标，简化为传统运输问题模型。
The new method is changing a nonlinear multi-objective program to single problem with simple mathematics (method. )
应用推荐