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.
References
- Greenberg, Harvey J., Klee-Minty Polytope Shows Exponential Time Complexity of Simplex Method University of Colorado at Denver (1997) PDF download
~ Table of Content ~
| ► | Introduction |
| ► | Problem input |
| ► | Algorithm |
| ► | Description |
| ► | References |
| ► | Note |
| ► | See also |
| ► | External links and sources |
~ What's Hot ~
500 Days Of Summer, The Blind Side, New Moon, The Princess And The Frog, The Box, Twilight, The Hangover, All About Steve, Legion, Sorority Row, The Mummy 4 Rise Of The Aztec, Avatar, District 9, Alvin And The Chipmunks The Squeakquel, Madagascar 3, The Karate Kid, The Book Of Eli, Percy Jackson The Olympians The Titan S Curse, Dear John, Up In The Air,
~ 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.