The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model (Q486944): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3206654 / 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: The simplex method. A probabilistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of the double description method and the beneath-beyond algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2930070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten / rank
 
Normal rank

Revision as of 12:23, 9 July 2024

scientific article
Language Label Description Also known as
English
The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
scientific article

    Statements

    The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model (English)
    0 references
    0 references
    0 references
    19 January 2015
    0 references
    The authors analyze the average number of pivot steps in the simplex method. They generalize the results of Borgwardt (who assumed the rotation-symmetry-model) to cylindric distributions. The new approach allows to analyze the problems with arbitrary (not necessarily positive) right hand sides of the constraints. These results follow from the solution of a problem from stochastic geometry, closely related to the results of Renyi and Sulanke.
    0 references
    linear programming
    0 references
    simplex method
    0 references
    probabilistic analysis
    0 references
    average case analysis
    0 references
    stochastic geometry
    0 references
    rotation symmetry model
    0 references

    Identifiers

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