Consistency of a linear system of inequalities (Q1061454): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4772965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00939253 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974628681 / rank
 
Normal rank

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
Consistency of a linear system of inequalities
scientific article

    Statements

    Consistency of a linear system of inequalities (English)
    0 references
    1986
    0 references
    We show that a consistency check of a linear system of inequalities Ax\(\leq b\) reduces to check whether Qb\(\geq 0\) for a certain matrix Q. It is a direct consequence of the Farkas-Minkowski theorem. Thus, when one has to check consistency for different values of b, one need not run a numerical algorithm for each b.
    0 references
    consistency check
    0 references
    linear system of inequalities
    0 references
    Farkas-Minkowski theorem
    0 references

    Identifiers