Inductive Proof of the Simplex Method

DOI10.1147/RD.45.0505zbMATH Open0129.33905OpenAlexW1979146630MaRDI QIDQ5338596FDOQ5338596

George Dantzig

Publication date: 1960

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.45.0505

zbMATH Keywords

operations research

Cited In (8)

• A projective simplex algorithm using LU decomposition
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A dual projective simplex method for linear programming
• A transportation model with multiple criteria and multiple constraint levels
• Extremal measures with prescribed marginals (finite case)
• Representing inverses in pure network flow optimization
• A dynamic transportation model with multiple criteria and multiple constraint levels
• A tutorial history of least squares with applications to astronomy and geodesy

This page was built for publication: Inductive Proof of the Simplex Method

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