此法称之为“广义单纯形法”。
单纯形法是求解线性规划问题的有效方法。
Simplex algorithm is an effective method for solving linear programming problem.
但在理论上，单纯形法被证明是指数复杂性的。
But it has been proved that the simplex method is exponential computational complexity in theory.
该算法是基于单目标、多约束条件的单纯形法。
This algorithm is a simplex method based on the simple object and multi_condition restriction.
本文叙述了单纯形法用于该厂的产品设计，节省了钢材。
Simplex method has been used on the design of new products in the factory and can save steel material.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
这是关于运筹学上的单纯形法的源码，此方法用的是两阶段法。
Tacticians on the simplex method source code, the use of this method is a two-stage method.
利用单纯形法求解该线性规划问题，便可得到整数规划的最优解。
By using simplex method to solve the LP, the optimal solution of ILP can be obtained.
大量数值实例表明，该算法的计算效率较普通单纯形法成倍提高。
The numerical examples show that the calculation speed of Iterative Simplex Algorithm is several times faster than that of general Simplex Algorithm.
本实验表明单纯形法是药物色谱分离最优化中一种简单有效的方法。
The simplex method seems to be one of the simple effective techniques for the optimization of chromatographic separation in drug analysis.
对于多约束则采用了紧约束处理，并用修正的单纯形法进行优化设计。
The optimization problem with multiple constraints is treated by the compact constraint tactics and is solved by the improved simplex method.
本文首先采用常规pid控制，其中参数寻优采用的是单纯形法寻优。
This text adopts the normal PID control firstly, using a pure form method to optimize PID parameters.
本文提出一种不用人工变量，适用于求解一般线性规划问题的单纯形法。
This paper presents a simplex method without using the artificial variables. It is suited to solve general linear programming problem.
根据凸分析理论和单纯形法原理，提出了指派问题的一个线性规划解法。
According to the raised analysis theory and the simplex method principle, proposed an assignment problem linear programming solution.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
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.
利用单纯形法的参数寻优技术，提出一种控制系统调节器优化设计的新方法。
The new method of optimisation design for the regulator in control system is stated on the optimum seeking technology of parameters by using the simplex method.
用稀疏对偶单纯形法求解每时段的经济功率分配，所用内存少，计算时间短。
Small memory capacity and short CPU time are repuired by the algorithm for the solution of the economic dispatch every interval with simple form of sparse dual method.
提出了一个新算法，取名为广义单纯形算法，它可被看作是单纯形法的扩展算法。
The paper presents a new algorithm which is named Generalized Simplex Algorithm. It is an extended algorithm of the Simplex Algorithm.
用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
它的收敛速度在高维情况下优于普通的单纯形法，同时计算量和存贮量均大大减少。
Under the condition of high dimensionality, it converges faster than the common simplex method, while its calculating work and storage space required are reduced greatly.
由于广义方法的迭代通常要跳过一些极点，因此收敛速度比单纯形法有明显的提高。
Since each iteration in the generalized method will usually skip over a number of extreme points, the convergence rate is obviously quicker than that in simplex method.
对于求解该问题，自单纯形法被提出以来，它一直是实际应用中极其有效的计算方法。
To resolve this problem, the simplex method is of good effect in practical application since it was advanced.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
进一步，我们讨论了随机线性规划的单纯形法，并且研究了这两种模糊随机线性规划的解法。
Furthermore a simplex method of the random linear programming is discussed, and the solution for fuzzy random linear programmings is studied.
为了对网络参数进行优化，本文提出了一种一般单纯形算法，这种方法比单纯形法收敛速度要快。
In order to optimize the parameters of the network, we propose the General Simplex Method, which converges more quickly than the Simplex Method.
为了对网络参数进行优化，本文提出了一种一般单纯形算法，这种方法比单纯形法收敛速度要快。
In order to optimize the parameters of the network, we propose the General Simplex Method, which converges more quickly than the Simplex Method.
应用推荐