A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities (Q2542393): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimality and Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5818935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über homogene lineare Ungleichungssysteme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Jordan elimination, linear programming and Tchebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285991 / rank
 
Normal rank

Latest revision as of 02:25, 12 June 2024

scientific article
Language Label Description Also known as
English
A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities
scientific article

    Statements

    A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities (English)
    0 references
    0 references
    0 references
    0 references
    1968
    0 references
    0 references
    0 references