On the recognition of \(S\)-systems
From MaRDI portal
Publication:1311323
DOI10.1016/0024-3795(93)90243-HzbMath0796.15020OpenAlexW2051701285MaRDI QIDQ1311323
Victor Klee, T. G. Lewis, Balder von Hohenbalken
Publication date: 10 October 1994
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)90243-h
combinatoricslinear systemsconvexityconvex conesystems of linear inequalitiesrecognition algorithm\(S\)-systemsign-solvability
Linear programming (90C05) Linear inequalities of matrices (15A39) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (2)
Cites Work
- Recognizing sign solvable graphs
- A new polynomial-time algorithm for linear programming
- Signsolvability revisited
- Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability
- Sign solvable graphs
- On the recognition of \(S\)-systems
- Graph-theoretical approach to qualitative solvability of linear systems
- Cones, matrices and mathematical programming
- Maximal convex sets
- The Structure of Qualitatively Determinate Relationships
- Polynomial algorithms in linear programming
- The Theory of Qualitative Linear Systems
- Qualitative Problems in Matrix Theory
- Generalized Predator-Prey Oscillations in Ecological and Economic Equilibrium
- Qualitative Economics and the Scope of the Correspondence Principle
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the recognition of \(S\)-systems