primal-dual algorithm的意思|示意

This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.

首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。

It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.

它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。

Finally, according to the bottleneck of Primal-Dual Interior-Point Algorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.

最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。

This algorithm consists of heuristic-based search algorithm, primal-dual-based optimal path selection algorithm and channel assignment adjustment algorithm.

包括启发式路径搜索算法、基于原始-对偶算法的最优路径选择算法、信道分配调整算法等三个部分。

On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;

给出了二次锥规划的一种非精确不可行内点算法。

To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.

在用对偶单纯形法解线性规划问题时，必须找到初始正则解。