Inductive Proof of the Simplex Method
From MaRDI portal
Publication:5338596
DOI10.1147/rd.45.0505zbMath0129.33905OpenAlexW1979146630MaRDI QIDQ5338596
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
Related Items (8)
A dual projective simplex method for linear programming ⋮ A projective simplex algorithm using LU decomposition ⋮ A dynamic transportation model with multiple criteria and multiple constraint levels ⋮ A transportation model with multiple criteria and multiple constraint levels ⋮ The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study ⋮ Extremal measures with prescribed marginals (finite case) ⋮ A tutorial history of least squares with applications to astronomy and geodesy ⋮ Representing inverses in pure network flow optimization
This page was built for publication: Inductive Proof of the Simplex Method
