总结单纯形搜索算法的核心思想。
此法称之为“广义单纯形法”。
提出了非线性单纯形算法的修改算法。
搜索过程可采用单纯形算法。
单纯形法是求解线性规划问题的有效方法。
Simplex algorithm is an effective method for solving linear programming problem.
文章以单纯形方法为基础求解建筑钢筋配料问题。
This paper provides an algorithm based on simplex method for construction steel bar matching.
该文提出了能有效加快收敛速度的修改单纯形算法。
A new modified simplex method can effectively accelerate convergence velocity of iteration.
本文介绍了单纯形优化法在岩矿分析中的实际应用。
The application of simplex optimization method for rock and mineral analysis is introduced.
用“映射单纯形”方法代替“单纯形顶点代换”方法；
The "mapping simplex method"is used instead of the "substitution of simplex vertexes".
经验遗传-单纯形算法正是解决这一问题的一种有效方法。
The empirical genetic-simplex algorithm is one of the effective method to solve the problem.
斯波纳引理涉及到把一个单纯形分解为较小的单纯形的问题。
Sperner's lemma concerns the decomposition of a simplex into smaller simplices.
这是关于运筹学上的单纯形法的源码，此方法用的是两阶段法。
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.
在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
We also present an algorithm based on implicit enumeration and simplex method on network.
本文首先采用常规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.
结果表明，单纯形优化法能以较少的实验次数，获得灵敏度最佳显色条件。
Results show that with simplex method, optimum sensitivity can be obtained with fewer experiments.
运用单纯形方法的一个问题是解为小数值，作者用一个简单的方法进行取整。
One problem caused by using simplex method is that the results are fractional values while need integers, and that provides a simple but effective method to solve it.
解线性规划问题除常见的单纯形法和对偶单纯形法外，还有一种原始对偶法。
Commonly in additional to simplex method and dual simplex method, another original dual method can solve the liner programming.
针对无约束函数最优化问题，提出了一种能有效加快收敛速度的改进单纯形算法。
An improved simplex method (ISM) based on Nelder and Meads simplex method (N-M SM) is presented for unconstrained function optimization.
提出了一个新算法，取名为广义单纯形算法，它可被看作是单纯形法的扩展算法。
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.
本文就单纯形算法选取入基变量的准则进行改进，给出一种新的选取入基变量的准则。
This paper makes improvement on the criterion of choosing basic variable in simplex algorithm and gives out a new selecting criterion.
对于求解该问题，自单纯形法被提出以来，它一直是实际应用中极其有效的计算方法。
To resolve this problem, the simplex method is of good effect in practical application since it was advanced.
对于求解该问题，自单纯形法被提出以来，它一直是实际应用中极其有效的计算方法。
To resolve this problem, the simplex method is of good effect in practical application since it was advanced.
应用推荐