| 单词 | simplex method |
| 释义 | > as lemmassimplex method simplex method n. a method for finding the optimal solution of a linear function subject to a set of linear constraints by application of the simplex algorithm; (also) the simplex algorithm itself. ΘΚΠ the world > relative properties > number > algebra > [noun] > expression > method of calculation or analysis extrapolation1872 functional analysis1876 inversion1880 Fourier analysis1929 formalism1940 linear programming1949 quadratic programming1951 simplex method1951 convex programming1963 deconvolution1967 1951 G. B. Dantzig in T. C. Koopmans Activity Anal. Production & Allocation xxi. 339 The general nature of the ‘simplex’ approach (as the method discussed here is known).] 1951 R. Dorfman in T. C. Koopmans Activity Anal. Production & Allocation xxii. 351 The simplex method makes use of the fact that any point in an n-dimensional space can be expressed as a sum of n linearly independent points. 1980 A. J. Jones Game Theory iii. 155 The relationship with our earlier notation is simply that we have replaced Aτ by A because this is the natural and universally accepted thing to do in setting up the simplex method. 2011 E. V. Denardo Linear Programming iv. 113 Computer codes that execute the simplex method are widely available. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。