The authors use the primal-dual interior point method to solve the problem.
采用原始-对偶内点法对该模型求解。
On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;
给出了二次锥规划的一种非精确不可行内点算法。
In case of problems with thousands of variables, the primal-dual algorithm will be far more efficient.
对于有大量变量的问题，原始对偶算法将更为有效。
The routines implement the simplex, branch and bound, primal-dual interior point, and many other algorithms.
这些程序实现了simplex算法、branchandbound算法、primal - dualinteriorpoint算法以及很多其他算法。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
This algorithm consists of heuristic-based search algorithm, primal-dual-based optimal path selection algorithm and channel assignment adjustment algorithm.
包括启发式路径搜索算法、基于原始-对偶算法的最优路径选择算法、信道分配调整算法等三个部分。
A primal-dual neural network(PDNN)based on linear variational inequalities(LVIs)is introduced as the real-time solver for the resultant quadratic programming scheme.
提出了基于线性变分不等式的原对偶神经网络，并将其作为所对应的二次型规划方案的实时求解器。
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.
最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。
The primal-dual interior point method can solve effectively the problem with a lot of constraints resulting from the motion equations of the generator rotors with the result of perfect convergence.
而原始-对偶内点法完全可以很好地解决由于发电机转子运动方程的引入带来的大量约束问题，具有极好的收敛特性。
The maximization problem is then called the primal problem, and the minimization is the dual problem.
在这个意义上最大化问题会被称为初始问题，最小化问题就称为对偶问题。
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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
First, the main procedures and the distinctive features of the most-obtuse-angle (MOA) row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming.
首先回顾了采用最钝角行、列主元规则求解线性规画问题的原始、对偶可行解的主要过程，阐述了其与众不同的特性。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
应用推荐