Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average number of pivot steps required by the Simplex-Method is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random polytopes: Their definition, generation and aggregate properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expected number of linear complementarity cones intersected by random and semi-random rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of vertices of random convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of steps of the simplex method of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity in Oriented Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable dimension algorithm for the linear complementarity problem / rank
 
Normal rank

Latest revision as of 18:56, 17 June 2024

scientific article; zbMATH DE number 3993327
Language Label Description Also known as
English
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
scientific article; zbMATH DE number 3993327

    Statements

    Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (English)
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    average running time
    0 references
    simplex algorithm
    0 references
    pivoting algorithm
    0 references
    lexicographic Lemke algorithm
    0 references
    random linear complementarity
    0 references