您要查找的是不是：
- Simplex Method for Linear Programming. 線(xiàn)性規劃的單純形算法。
- Three model parameters were estimated by using the simplex method. 采用單純形法對3個(gè)模型參數進(jìn)行了估計。
- The simplex method represents the backbone of most of the techniques presented in the book. 單純形法是本書(shū)中提出的絕大部分技術(shù)的基礎。
- Chapter nine considers the minimal cost network flow problem from the simplex method point of view. 第九章從單純形方法的觀(guān)點(diǎn)考慮網(wǎng)絡(luò )流問(wèn)題的最小化。
- Whenever possible, the simplex method is specialized to take advantage of problem structure. 任何時(shí)候，只要可能，利用問(wèn)題的結構，將單純形法特殊化。
- Many of the procedures in this part are presented as a direct simplification of the simplex method. 這部分的很多程序是作為單純形法的直接簡(jiǎn)化提出的。
- Chapter five deals with some specializations of the simplex method and the development of optimality criteria in linear programming. 第五章處理一些專(zhuān)門(mén)的單純形法和建立了線(xiàn)性規劃的最優(yōu)準則。
- Learning rate and neuron's scale factor of the neural PID controller are optimized by the simplex method. 摘要利用單此形法優(yōu)化神經(jīng)元PID控制器的學(xué)習速率和神經(jīng)元比例系數。
- By using simplex method to solve the LP, the optimal solution of ILP can be obtained. 利用單純形法求解該線(xiàn)性規劃問(wèn)題,便可得到整數規劃的最優(yōu)解。
- The MILP model is solved by combining a simulated annealing procedure with simplex method. 本文 提出混合線(xiàn)性整數規劃模型，將整數變量和連續變量分開(kāi)，當運送順序給定 后，整數變量的值就相應確定，此混合線(xiàn)性整數卻成u模型隨之成為連續變量的 線(xiàn)性卻成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. 采用運籌學(xué)中線(xiàn)性規劃的單純形法，確定了切削用量最優(yōu)方案。
- Based on ITAE guideline,three parameters of PID controller are optimized by using simplex method. 基于ITAE準則,采用單純形法對液粘傳動(dòng)PID調節器三個(gè)參數進(jìn)行尋優(yōu)設計,通過(guò)優(yōu)化使系統性能達到最優(yōu)。
- Comparing with Basic Simplex Method(BSM) and Modifier Simplex Method (MSM) , the MWCM has higher optmizing efficiency and accuracy. 與等度單純形法及改進(jìn)單純形法相比,MWCM方法具有更高的尋優(yōu)效率和尋優(yōu)精度。
- In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program. 二分單純形算法中,線(xiàn)性規劃問(wèn)題的最優(yōu)解是通過(guò)求解一系列子問(wèn)題來(lái)實(shí)現的。
- An improved simplex method(ISM)based on Nelder and Mead s simplex method(N-M SM) is presented for unconstrained function optimization. 針對無(wú)約束函數最優(yōu)化問(wèn)題,提出了一種能有效加快收斂速度的改進(jìn)單純形算法。
- 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. 此問(wèn)題可轉化為線(xiàn)性規劃模式，所以可用簡(jiǎn)形法求解，但是用此章的解法較簡(jiǎn)單。
- The "Mapping Simplex Method" is used instead of the "Substitution of Simplex Vertexes".The "Simplex Compression" can be chosen in the calculation. 在原單純形算法的基礎上增加了一種新的反射方向的計算方法 ;
- In the simplex method of linear programming,there is a big M method(the penalty factor method) for finding an initial feasible basis. 在線(xiàn)性規劃的單純形法中,為求初始的可行基有著(zhù)名的大M法,即懲罰因子法。
- By using improved simplex method and residuals method,a calculation based on the parameters of compartment model of pharmacokinetics is presented. 基于改進(jìn)的單純形算法和殘數法,對藥物動(dòng)力學(xué)房室模型中的有關(guān)參數計算進(jìn)行了研究。
