scientific article; zbMATH DE number 949658

MaRDI QIDQ4716334zbMATH OpenFDO

Authors Karl-Heinz Küfer

Publication date 26 November 1996

zbMATH Keywords

asymptotic expansionconvex hullstochastic geometryprobabilistic analysisrandom polyhedronexpected number of pivot stepsshadow vertex algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 764392
• On the variance of the number of pivot steps required by the simplex algorithm
• 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

Cited in

(8)

• 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 764392 (Why is no real title available?)
• A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
• scientific article; zbMATH DE number 671942 (Why is no real title available?)
• A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• On the variance of the number of pivot steps required by the simplex algorithm

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 Q4716334)