本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。
This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
一种基于线性规划及对偶分析的战场物资运输的指挥控制方法为解决此类问题提供了一种可行途径。
This paper proposes a command and control method of the battlefield materials transportation, which is based on linear programming and dual analysis.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
应用推荐