| 单词 | simplex algorithm |
| 释义 | > as lemmassimplex algorithm simplex algorithm n. an algorithm used for finding the optimal solution of a linear function subject to a set of linear constraints by considering adjacent vertices of a convex polytope, each subsequent vertex representing a better solution of the function than the previous one.The simplex algorithm was developed by American mathematician George Dantzig (1914–2005). ΚΠ 1954 G. B. Dantzig & D. R. Fulkerson in Naval Res. Logistics Q. 1 217 Even a large transportation type problem having no special features can be solved by hand using the simplex algorithm. 1984 New Scientist 6 Dec. 20/3 Narendra Karmarker has developed an algorithm which is both polynomial and outperforms the simplex algorithm in practice. 2017 R. W. Cottle & M. N. Thapa Linear & Nonlinear Optimization iv. 87 Testing the system for the existence of a solution can be carried out by formulating the corresponding Phase I Problem and solving it by the Simplex Algorithm. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。