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 analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
本文通过对线性规划问题中的核心矩阵的分析,提出了一种基于核心矩阵的原始对偶算法。
应用推荐