scientific article; zbMATH DE number 3648423

MaRDI QIDQ3206654zbMATH OpenFDO

Authors K. H. Borgwardt

Publication date 1977

zbMATH Keywords

complexity of linear programmingcomputational complexityefficiency of algorithmslinear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Linear programming (90C05) Stochastic programming (90C15)

Cited in

(6)

• On the length of simplex paths: The assignment case
• Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
• The Average number of pivot steps required by the Simplex-Method is polynomial
• The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
• A friendly smoothed analysis of the simplex method
• George Dantzig's impact on the theory of computation

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