The Simplex Method - Computational Checks for the Simplex Calculation

G. Yarmish (yarmishsci.brooklyn.cuny.edu)

Abstract: 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.

Keywords: Simplex, Primal, Dual, Computational Checks

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation:

Download: [PDF]

Entry Submitted: 07/25/2005
Entry Accepted: 07/26/2005
Entry Last Modified: 07/25/2005

Modify/Update this entry