scientific article; zbMATH DE number 3538744

zbMATH Open0345.65033MaRDI QIDQ4114709FDOQ4114709

Donald Goldfarb

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (6)

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

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)