Linear programming
In mathematics, linear programming (LP) problems are optimization problems in which the objective function and the constraints are all linear.
See also
- Simplex algorithm, used to solve LP problems
- Shadow price
~ Table of Content ~
| ► | Introduction |
| ► | Standard form |
| ► | Augmented form (slack form) |
| ► | Duality |
| ► | Theory |
| ► | Algorithms |
| ► | Integer unknowns |
| ► | See also |
| ► | File formats |
| ► | Solver packages |
| ► | References |
| ► | External links |
~ What's Hot ~
Avatar, The Blind Side, A Nightmare On Elm Street, The Mummy 4 Rise Of The Aztec, Alvin And The Chipmunks The Squeakquel, Twilight, New Moon, The Princess And The Frog, Percy Jackson The Olympians The Titan S Curse, Madagascar 3, The Karate Kid, Legion, The Book Of Eli, Hannah Montana The Movie, 500 Days Of Summer, Sorority Row, All About Steve, The Hangover, The Goods Live Hard Sell Hard, 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.