Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
From MaRDI portal
Publication:5626131
DOI10.1016/0041-5553(64)90009-6zbMath0221.65055OpenAlexW2081041113MaRDI QIDQ5626131
Publication date: 1966
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(64)90009-6
Related Items (9)
Efficient constraint/generator removal from double description of polyhedra ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Designing two factor experiments for selecting interactions ⋮ Efficient edit rule implication for nominal and ordinal data ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method? ⋮ Two variations of graph test in double description method ⋮ Automatic Editing for Business Surveys: An Assessment of Selected Algorithms
This page was built for publication: Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
