对偶单纯形法

线性规划对偶单纯形法的常识性经济解释

Commonsensible Economic Description of Dual Simplex Method for Linear Programming

本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术，建立问题的一个直接对偶单纯形法。

This paper discusses linear programming problems with generalized bounded variables . 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 .

变量有广义界线性规划的直接对偶单纯形法

A Direct Dual Simplex Method for Linear Programming with Generalized Bounded Varibles

线性规划一种改进的对偶单纯形法

Improved Dual Simplex Method for Linear Programming

对偶单纯形法的一点补充

A Supplement to Dual Simplex Method

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

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

解线性规划问题除常见的单纯形法和对偶单纯形法外，还有一种原始对偶法。

Commonly in additional to simplex method and dual simplex method , another original dual method can solve the liner programming .

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

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

与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。

Compared with the dual simplex method , the amount of the storage and calculations of the improved algorithm is largely reduced .

根据改进原始单纯形法思想，建立了标准型线性规划对偶单纯形法的一种改进算法。

Based on the improved algorithm for the primal simplex method , an improved algorithm of the dual simplex method for the linear programming with standard constraints are analyzed and presented .

参数法、网络单纯形法与对偶网络单纯形法，来处理原水库问题。

First , self-dual parametric algorithm , network simplex , and network dual simplex were offered to solve reservoir problem .

对偶单纯形两阶段法

Two-phase method of dual simplex

为避免人工约束的引入，利用变量代换，给出不增加变量个数的对偶单纯形两阶段法。

To avoid introduce the artificial restriction , in the essay , the author employed the variable replacement and provided a two-phase method of dual simplex in which the number of variable was not added .

二阶锥规划的Lagrange对偶及2维原始对偶单纯形法

Lagrange dual problem of second-order cone programming and its 2-dimentional primal-dual simplex method