The Nelder-Mead simplex method for function minimization is a "direct" method requiring no derivatives. The objective function is evaluated at the vertices of a simplex, and movement is away from the ...

MIT, Cambridge] and the original simplex method with the most-negative-reduced-cost pivoting rule of Dantzig are strongly polynomial-time algorithms for solving the Markov decision problem (MDP) with ...