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.
External links and sources
- An Introduction to Linear Programming and the Simplex Algorithm by Spyros Reveliotis of the Georgia Institute of Technology.
- Java-based interactive simplex tool hosted by Argonne National Laboratory.
- Simplex Algorithm by Elmer G. Wiens. Demonstrates algorithm in detail, using the simplex tableau.
- Tutorial for The Simplex Method by Stefan Waner, hofstra.edu. Interactive worked example.
~ Table of Content ~
| ► | Introduction |
| ► | Problem input |
| ► | Algorithm |
| ► | Description |
| ► | References |
| ► | Note |
| ► | See also |
| ► | External links and sources |
~ What's Hot ~
Twilight, The Princess And The Frog, Law Abiding Citizen, My Sister S Keeper, Alvin And The Chipmunks The Squeakquel, The Mummy 4 Rise Of The Aztec, Fantastic Mr Fox, Cedar Boys, The Hangover, 500 Days Of Summer, The Blind Side, The Lovely Bones, Hannah Montana The Movie, The Ugly Truth, The Goods Live Hard Sell Hard, Lethal Weapon 5, The Boondock Saints Ii All Saints Day, New Moon, Avatar, Madagascar 3,
~ 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.