ConceptTheory & Algos
Farkas lemma
A theorem stating that a system of linear inequalities either has a solution or there exists a non-negative linear combination of the inequalities resulting in an impossible inequality like 0 >= 1.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Fourier-Motzkin elimination1Linear inequalities1Linear programming1Linear programming duality1System of equations1System of linear inequalities1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
7The lectures that define it or assume it, and the concepts next to it.