The purpose of this paper is to derive computational checks for the simplex method of Linear Programming which can be applied at any iteration. The paper begins with a quick review of the simplex algorithm. It then goes through a theoretical development of the simplex method and its dual all the time focusing on the derivation of computational checks.
Article
View The Simplex Method - Computational Checks for the Simplex Calculation