1) dual simplex method
对偶单纯形方法
2) dual simplex algorithm
对偶单纯形法
1.
By analyzing the essence of iteration on the dual simplex algorithm and based on Linear Programming with normal form,this paper gains another improved dual simplex algorithm without bringing in surplus variables,which results in the same number of variables and reduced operational size.
通过分析对偶单纯形法迭代的实质,就所给LP问题的规范形式,不引进剩余变量而直接得出另一种改进的对偶单纯形法,使变量个数不增且运算规模缩小。
2.
To solve a linear programming with the dual simplex algorithm,it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时,必须找到初始正则解。
3) dual simplex method
对偶单纯形法
1.
With the help of the technique of simplex method for standard constrained linear programming,a direct dual simplex method for the discussed problems is presented.
本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术,建立问题的一个直接对偶单纯形法。
2.
A modification of dual simplex method for linear programming is discussed.
研究了线性规划对偶单纯形法的改进。
3.
This new problem is called extended problem which can be solved by the dual simplex method.
可以用对偶单纯形法解此扩充问题。
4) simplex method for dual
对偶单纯形法
1.
It carries out the thought that simplex method for dual all non-positive tests numbers.
本文通过增加一个特殊约束,贯彻对偶单纯形法检验数全非正的思想,迭代求优;然后再去掉该约束,结果却可得到一个基可行解。
5) dual simplex method
对偶单纯形
1.
The paper discusses the fractional transshipment problem and its dual simplex method.
线性分式规划可通过增加变量和约束或单纯形法加以解决，本文给出了分式转运问题的一种类似图上作业法的简便解法，并讨论了分式转运法问题的对偶单纯形
6) primal-dual simplex method
原始对偶单纯形法
1.
Lagrange dual problem of second-order cone programming and its 2-dimentional primal-dual simplex method
二阶锥规划的Lagrange对偶及2维原始对偶单纯形法
补充资料：单纯形方法
见线性规划。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条