Operations research, mathematical programming Linear programming Concept
Fourier–Motzkin elimination
Summary
Fourier–Motzkin elimination removes one variable from a system of linear inequalities, as Gaussian elimination does for equations. The new system has a solution exactly when the old one has, and its solutions are the projections of the old solutions. Repeating it decides whether a system of linear inequalities is solvable. It gives short proofs of Farkas' lemma and of the fact that projections of polyhedra are polyhedra. The number of inequalities can grow very fast, so it is mainly a theoretical tool.
Further reading
About this page
| Tag | MJQARBFG10 |
|---|---|
| URI | m2://MJQARBFG10 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 90C05, 15A39, 52B55 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.