computer package programs for mathematical programming techniques to solve linear programming models

Abstract

In developing the simplex algorithm, G. Daunting made use of the classical Gauss-Jordan elimination method which is families to anyone solved a system of linear equations. 'The key idealistic a multiple of one equation and add it to or subtraction another equation in order to eliminate one of the unknowns from the second evacuation.