Linear programming is a single goal programming method, the goal function get the maximum or minimum on the basis of limit condition.
线性规划是一种单目标规划,根据有关的约束条件得出目标函数的最大值或最小值。
On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimum cost maximum flow algorithm.
在此基础上以运输成本最小化为二级目标建立模型,将其转化成带有分层的网络流模型,用最小费用最大流算法进行求解。
Then, at the basis of the relation of truncation error and related coefficients, a real-time RK4 formula with maximum stability region and minimum truncation error is deduced.
然后,根据截断误差与相关系数的关系,导出了具有最大稳定域最小截断误差的实时RK4公式。
应用推荐