On a Problem in Linear Inequalities

From MaRDI portal





In a paper [Proc. Lond. Math. Soc. (3) 16, 519--536 (1966; Zbl 0166.03005)] \textit{A. W. Ingleton} considered the question of the existence of a unique soIution to the system \[ y=A x+c, \ x \geq 0, \ y \geq 0, \ x^{t} y=0, \tag{*} \] where \( c=A v \) for some vector \(v\) and \(A= NBN^{t} \) for some matrix \(N\) and positive definite matrix \(B\). Ingleton answers the question by introducing a class of matrices called adequate. The author relates the problem (*) to earlier work in quadratic programing. Ingleton's main theorem is shown to follow from mathematical programming theory, but, nevertheless yields new and interesting results on positive definite matrices.





Cited in
(26)








This page was built for publication: On a Problem in Linear Inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5570983)