scientific article; zbMATH DE number 3898607

MaRDI QIDQ3677503zbMATH OpenFDO

Authors K. H. Borgwardt

Publication date 1985

zbMATH Keywords

average complexityinequality constraintsrotation symmetry modelsign invariance modelsimplex methodstochastic modelsurvey

Mathematics Subject Classification ID

Random convex sets and integral geometry (aspects of convex geometry) (52A22) Geometric probability and stochastic geometry (60D05) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4197740
• The simplex method. A probabilistic analysis
• The average computing time of the simplex method in a generalized rotational symmetry model
• How fast does the simplex method usually work? Or: the search for (stochastic) independence
• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension

Cited in

(15)

• Intelligent gradient search in linear programming
• The simplex method. A probabilistic analysis
• How fast does the simplex method usually work? Or: the search for (stochastic) independence
• scientific article; zbMATH DE number 3843665 (Why is no real title available?)
• scientific article; zbMATH DE number 3845338 (Why is no real title available?)
• Ein effektives simplexverfahren mit teiltableauwahl
• Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
• An asymptotic estimate of the average number of steps of the parametric simplex method
• scientific article; zbMATH DE number 4027159 (Why is no real title available?)
• Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry
• scientific article; zbMATH DE number 1041033 (Why is no real title available?)
• The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
• A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
• scientific article; zbMATH DE number 3894829 (Why is no real title available?)
• The average computing time of the simplex method in a generalized rotational symmetry model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677503)