Consistency of linear inequalities over sets
HTML articles powered by AMS MathViewer
- by Abraham Berman PDF
- Proc. Amer. Math. Soc. 36 (1972), 13-17 Request permission
Abstract:
Necessary and sufficient conditions for the equivalence of the statements: (I) The system $b - Ax \in T,x \in S$, is consistent. (II) $y \in {T^ \ast },{A^H}y \in {S^ \ast } \Rightarrow \operatorname {Re} (b,y) \geqq 0$, are given in terms of the sets S and T and the matrix A. Sufficient conditions for this equivalence are obtained in the case where S and T are closed convex cones.References
- Adi Ben-Israel, Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory, J. Math. Anal. Appl. 27 (1969), 367–389. MR 242865, DOI 10.1016/0022-247X(69)90054-7
- Abraham Berman and Adi Ben-Israel, More on linear inequalities with applications to matrix theory, J. Math. Anal. Appl. 33 (1971), 482–496. MR 279117, DOI 10.1016/0022-247X(71)90072-2
- Abraham Berman and Adi Ben-Israel, Linear inequalities, mathematical programming and matrix theory, Math. Programming 1 (1971), 291–300. MR 381716, DOI 10.1007/BF01584093
- Ky Fan, A generalization of the Alaoglu-Bourbaki theorem and its applications, Math. Z. 88 (1965), 48–60. MR 178326, DOI 10.1007/BF01112692 J. Farkas, Über Theorie der einfachen Ungleichungen, J. Reine Angew. Math. 124 (1902), 1-24.
- Norman Levinson, Linear programming in complex space, J. Math. Anal. Appl. 14 (1966), 44–62. MR 225569, DOI 10.1016/0022-247X(66)90061-8
- R. Tyrrell Rockafellar, Convex analysis, Princeton Mathematical Series, No. 28, Princeton University Press, Princeton, N.J., 1970. MR 0274683 V. A. Sposito and H. T. David, A note on Farkas lemmas over cone domains, Iowa State University Report.
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 36 (1972), 13-17
- MSC: Primary 15A39; Secondary 90C05
- DOI: https://doi.org/10.1090/S0002-9939-1972-0309967-6
- MathSciNet review: 0309967