您要查找的是不是：
- generalized simplex method 推广的单形法,广义单纯形法
- Simplex Method for Linear Programming. 线性规划的单纯形算法。
- Three model parameters were estimated by using the simplex method. 采用单纯形法对3个模型参数进行了估计。
- The simplex method represents the backbone of most of the techniques presented in the book. 单纯形法是本书中提出的绝大部分技术的基础。
- Chapter nine considers the minimal cost network flow problem from the simplex method point of view. 第九章从单纯形方法的观点考虑网络流问题的最小化。
- Whenever possible, the simplex method is specialized to take advantage of problem structure. 任何时候，只要可能，利用问题的结构，将单纯形法特殊化。
- Many of the procedures in this part are presented as a direct simplification of the simplex method. 这部分的很多程序是作为单纯形法的直接简化提出的。
- Chapter five deals with some specializations of the simplex method and the development of optimality criteria in linear programming. 第五章处理一些专门的单纯形法和建立了线性规划的最优准则。
- Learning rate and neuron's scale factor of the neural PID controller are optimized by the simplex method. 摘要利用单此形法优化神经元PID控制器的学习速率和神经元比例系数。
- By using simplex method to solve the LP, the optimal solution of ILP can be obtained. 利用单纯形法求解该线性规划问题,便可得到整数规划的最优解。
- The MILP model is solved by combining a simulated annealing procedure with simplex method. 本文 提出混合线性整数规划模型，将整数变量和连续变量分开，当运送顺序给定 后，整数变量的值就相应确定，此混合线性整数却成u模型随之成为连续变量的 线性却成u（LP）模型，再用模拟退火法与单纯形法相结合求解。
- A new modified simplex method can effectively accelerate convergence velocity of iteration. 该文提出了能有效加快收敛速度的修改单纯形算法。
- Using a simplex method of linear programming in operational research ,we determinedthe optimal plan of turning amount. 采用运筹学中线性规划的单纯形法，确定了切削用量最优方案。
- Based on ITAE guideline,three parameters of PID controller are optimized by using simplex method. 基于ITAE准则,采用单纯形法对液粘传动PID调节器三个参数进行寻优设计,通过优化使系统性能达到最优。
- A Generalized Dual Simplex Method 广义对偶单纯形方法
- Comparing with Basic Simplex Method(BSM) and Modifier Simplex Method (MSM) , the MWCM has higher optmizing efficiency and accuracy. 与等度单纯形法及改进单纯形法相比,MWCM方法具有更高的寻优效率和寻优精度。
- In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program. 二分单纯形算法中,线性规划问题的最优解是通过求解一系列子问题来实现的。
- An improved simplex method(ISM)based on Nelder and Mead s simplex method(N-M SM) is presented for unconstrained function optimization. 针对无约束函数最优化问题,提出了一种能有效加快收敛速度的改进单纯形算法。
- This problem can also be formulated as a LP problem, so it can be solved by the simplex method, however, using Augmenting Path Algorithm is easier. 此问题可转化为线性规划模式，所以可用简形法求解，但是用此章的解法较简单。
- The "Mapping Simplex Method" is used instead of the "Substitution of Simplex Vertexes".The "Simplex Compression" can be chosen in the calculation. 在原单纯形算法的基础上增加了一种新的反射方向的计算方法 ;
