Sign-consistency and solvability of constrained linear systems

Electronic Journal of Linear Algebra

Volumn 4, Issue , 1998, Pages 1-18

  Lee, Gwang Yeon ^a,b   Shader, Bryan L ^c  

^a Hanseo University   (South Korea)

^b UNIVERSITY OF WYOMING   (United States)

^c UNIVERSITY OF WYOMING   (United States)

Author keywords

Linear systems; Qualitative Matrix Theory; Sign solvable

Indexed keywords

EID: 0042350708     PISSN: 10813810     EISSN: None     Source Type: Journal    
DOI: 10.13001/1081-3810.1021     Document Type: Article

References (9)

1. T. Ando and R. A. Brualdi. Sign-Central Matrices. Linear Algebra Appl., 208/209:283-295 (1994).
2. R. A. Brualdi and H. J. Ryser. Combinatorial Matrix Theory. Cambridge University Press, Cambridge, 1991.
3. R. A. Brualdi and B. L. Shader. Matrices of Sign-Solvable Linear Systems. Cambridge University Press, Cambridge, 1995.
4. G. V. Davydov and I. M. Davydova. Solubility of the system Ax = 0, x ≥ 0 with indefinite coefficients. Soviet Math. (IZ. VUZ), 34(9):108-112, 1990.
5. V. Klee, R. Ladner, and R. Manber. Signsolvability revisited. Linear Algebra Appl., 59:131-157, 1984.
6. P. D. Lax. Linear Algebra. John Wiley, New York, 1997.
7. W. McCuaig, N. Robertson, P. D. Seymour, R. Thomas. Permanents, Pfaffian orientations, and even directed circuits. Preprint, 1997.
8. P. A. Samuelson. Foundations of Economic Analysis. Harvard University Press, Cambridge, Mass., 1947, Atheneum, New York, 1971.
9. A. Schrijver. Polyhedal Combinatorics, in Handbook of Combinatorics, Volume II, R.L. Graham, M. Grötschel, and L. Lovász, editors. The MIT Press, Cambridge, Mass., 1995, pp. 1649-1704.