对于有大量变量的问题，原始对偶算法将更为有效。

In case of problems with thousands of variables, the primal-dual algorithm will be far more efficient.

youdao

本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。

This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.

youdao

摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。

This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.

youdao