您要查找的是不是：
- On the Dual Simplex Algorithm with Largest Improvement Rule 关于使用最大改进规则的对偶单纯形算法
- dual simplex algorithm 对偶单纯形算法
- First, self-dual parametric algorithm, network simplex, and network dual simplex were offered to solve reservoir problem. 先利用自对偶参数法、网络单纯形法与对偶网络单纯形法，来处理原水库问题。
- How good is the simplex algorithm? 单纯形算法有多好?
- The abecedarian numerical computation shows that the new algorithm is more effective than the primary simplex algorithm. 初步数值结果表明新算法比传统方法更为有效。
- The network simplex, network dual simplex, and complimentary theorem were used to solve reservoir and its dual problems. 文中采用网络单纯形法、对偶网络单纯形法及互补定理，来处理水库问题及对偶问题。
- The result shows the algorithm is effective and simpler than simplex algorithm. 该算法的计算结果与单纯形法的结果完全相同,但求解过程较后者简洁。
- The isotropic surfaces of both fce and bcc metals under plane stress were calculated by Taylor theory which was solved with the linear programming dual simplex method. 本文用对偶单形法线性规划求解Taylor理论,计算了面心立方和体心立方金属在平面应力条件下各向同性屈服表面。
- The new algorithm has not only the global of genetic algorithm, but also the fast convergence of the simplex algorithm. 该新算法既具有遗传算法的全局收敛性，又具有单纯形法的快速收敛性。
- Linear Programming Simplex method, dual problems, dual simplex method, duality theorems, complementary slackness, sensitivity analysis and transportation problem. Students taking this course are expected to have knowledge in linear algebra. 线性规划单纯形法,对偶问题,对偶单纯形法,对偶性定理,互补松弛性,灵敏度分析及运输问题。学生选修本科须具备线性代数之知识。
- Presents a generalized dual simplex metjhod of directly solving a linear programming problem to which the basic solution is neither a feasible solution to the primal problem nor a feasible solution to the dual problem. 在已经得到的线性规划问题的基本解既不是原始问题的可行解 ,也不是对偶问题的可行解的情形下 ,介绍求解线性规划问题的广义对偶单纯形法 ,它是对偶单纯形法的推广 ,用此法迭代一次就可得到一个对偶可行解
- The time lag between the direct wave and the scattered wave could be computed by using the simplex algorithm method. 当弯曲波在传递时遇到平板裂缝则会产生散射波，因此含有裂缝平板的板波讯号即包括弯曲波的直接波传与裂缝引起的散射波传。
- In this paper a dual simplex method for linear programming with bounded variables was given, which generalizes and extends the classic dual simplex method for a general linear programming. 摘要给出变量有上界的线性规划问题的对偶单纯形算法，该算法包含了一般线性规划问题的对偶单纯形算法，为解变量有上界的线性规划问题提供了又一种方法。
- In this paper we improve the simplex algorithm for quadratic programs, from algorithm to convergence conditions, and get simpler procedure and converging rules. 摘要本文对二次规划的单纯形算法，从算法到收敛条件均加以改进，得到更简易的程序和收敛准则。
- Moreover, it edits the calculating programs in both index Method,which gives the approximate solution and Simplex Algorithm,which gives the accurate solution. 设计了用指数法求近似解或单纯形法求精确解的算法程序。
- A Generalized Dual Simplex Method 广义对偶单纯形方法
- Two-phase method of dual simplex 对偶单纯形两阶段法
- Improved Dual Simplex Method for Linear Programming 线性规划一种改进的对偶单纯形法
- Kalai, Gil. "A Subexponential Randomized Simplex Algorithm (Extended Abstract)." In Proceedings of the 24th Annual Association for Computing Machinery Symposium on Theory of Computing. New York, NY: ACM Press, 1992. 一种亚指数随机化的简单型法（扩展摘要）〉，《第24届计算理论的机器计算年会公报》，纽约，ny：ACM出版，1992。
- the best pivot of the dual simplex method 对偶单纯形最好主元素
