Linear Programming: An introduction with emphasis on the cycling phenomenon of linear programming

Abstract

It is the general intent of this thesis to, in the first part, develop and explain the procedure of Dantzig's simplex method in solving linear programming problems. The second part is devoted to an investigation into cycling and degeneracy in linear programming problems. This investigation includes the examples found of cycling and also Dantzig's method of perturbing to prevent degeneracy and cycling. This thesis is intended to read in such a way that a person need only to have a basic understanding of linear Algebra to comprehend the material contained in this paper.