Systems of Linear Relations
From MaRDI portal
Cited in
(9)- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Consistency, redundancy, and implied equalities in linear systems
- A discrete variant of Farkas' lemma
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- On the key theorem of Tucker and Levison for complex linear inequalities
- A combinatorial approach to convex quadratic programming
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
- A discrete variant of Farkas' lemma and related results
- A note on the short algebraic proof of Farkas' Lemma
This page was built for publication: Systems of Linear Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5638442)