Linear inequalities, mathematical programming and matrix theory

DOI10.1007/BF01584093zbMath0249.90037OpenAlexW1973770796MaRDI QIDQ5663632

Abraham Berman, Adi Ben-Israel

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584093

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Miscellaneous inequalities involving matrices (15A45)

Related Items

Results of farkas type, Lagrangian duality in convex conic programming with simple proofs, Modified regularity conditions for nonlinear programming problems over mixed cone domains, The theorem of the alternative, the key-theorem, and the vector-maximum problem, On rigidity and realizability of weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrices \(C\) with \(C^ n\to 0\)
• Linear programming in complex space
• Positive operators and an inertia theorem
• A duality theorem for complex quadratic programming
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Inertia theory for simultaneously triangulable complex matrices
• More on linear inequalities with applications to matrix theory
• A generalization of irreducible monotonicity
• Linear equations over cones with interior: a solvability theorem with applications to matrix theory
• Nonlinear programming in complex space: Sufficient conditions and duality
• A Note on Pencils of Hermitian or Symmetric Matrices