Simplex algorithm
In mathematical optimization theory, the simplex algorithm of George Dantzig is the fundamental technique for numerical solution of the linear programming problem. A variation commonly used in nonlinear regression programs is the Nelder-Mead method or Simplex method or downhill simplex method due to Nelder & Mead (1965) and is a numerical method for solving many-dimensional problems, belonging to the more general class of search algorithms.
See also
~ Table of Content ~
| ► | Introduction |
| ► | Problem input |
| ► | Algorithm |
| ► | Description |
| ► | References |
| ► | Note |
| ► | See also |
| ► | External links and sources |
~ What's Hot ~
The Time Traveler S Wife, The Karate Kid, I Love You Beth Cooper, New Moon, The Mummy 4 Rise Of The Aztec, Twilight, My Sister S Keeper, Jennifer S Body, Clash Of The Titans, 500 Days Of Summer, Cloudy With A Chance Of Meatballs, The Blind Side, Dear John, The Goods Live Hard Sell Hard, The Hangover, Avatar, The Princess And The Frog, Percy Jackson The Olympians The Lightning Thief, Alvin And The Chipmunks The Squeakquel, The Boondock Saints Ii All Saints Day,
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.