A bump triangular dynamic factorization algorithm for the simplex method (Q3865837): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex method of linear programming using LU decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix augmentation and partitioning in the updating of the basis inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete constructive algorithm for the general mixed linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization approach to large-scale linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection methods of the Devex LP code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinversion with the preassigned pivot procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spike Collective Dynamic Factorization Algorithm for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4114710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank

Latest revision as of 03:31, 13 June 2024

scientific article
Language Label Description Also known as
English
A bump triangular dynamic factorization algorithm for the simplex method
scientific article

    Statements

    A bump triangular dynamic factorization algorithm for the simplex method (English)
    0 references
    1980
    0 references
    bump triangular dynamic factorization algorithm
    0 references
    simplex method
    0 references
    large- scale linear programming
    0 references
    computational experience
    0 references
    sparse matrices
    0 references
    triangular factorization of the basis
    0 references
    partitioning methods
    0 references
    comparison of algorithms
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references