scientific article; zbMATH DE number 3538744

MaRDI QIDQ4114709zbMATHFDO

Authors Donald Goldfarb

Publication date 1976

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cited in

(6)

• A friendly smoothed analysis of the simplex method
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• Upper and lower bounds on the smoothed complexity of the simplex method
• Steepest-edge simplex algorithms for linear programming
• Testing of a large-scale network optimization program
• On the Bartels—Golub decomposition for linear programming bases

Describes a project that uses

Uses Software

• DEVEX

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