problèmes d'optimisation linéaire par matrice. Anglais : <span class="searchmatch">simplex</span> <span class="searchmatch">algorithm</span> (en), <span class="searchmatch">simplex</span> method (en) <span class="searchmatch">algorithme</span> <span class="searchmatch">du</span> <span class="searchmatch">simplexe</span> sur l’encyclopédie Wikipédia...
Un <span class="searchmatch">simplexe</span> de dimension n est un polytope de dimension n à n + 1 sommets, nombre minimal possible. — (<span class="searchmatch">simplexe</span> ou hypertétraèdre) <span class="searchmatch">algorithme</span> <span class="searchmatch">du</span> simplexe...
algoridiome <span class="searchmatch">algorithme</span> de Bellman-Ford <span class="searchmatch">algorithme</span> de Dijkstra <span class="searchmatch">algorithme</span> <span class="searchmatch">du</span> <span class="searchmatch">simplexe</span> <span class="searchmatch">algorithme</span> probabiliste <span class="searchmatch">algorithme</span> randomisé <span class="searchmatch">algorithmique</span> <span class="searchmatch">algorithmie</span> algorithmisation...
\mathbb {R} } n-m dans le premier orthant, […]. — (Denis Lugiez, <span class="searchmatch">Algorithme</span> <span class="searchmatch">du</span> <span class="searchmatch">simplexe</span>, chap. 3, p. 2) orthant positif orthant non-positif demi-droite...