ABSTRACT
The simplex method is essentially an algorithm that systematically examines basic feasible solutions of a standard-form LP for optimality. The discussion begins with some preliminary simplifications and then proceeds to set forth our notation and recall some pertinent algebra. The section headings provide you with a list of the major parts of the method for easy reference. There are many variations of the simplex method and there are newer methods. Exploring the books on the Reading List and the references in those books will expose you to a vast literature on LP; this chapter is merely an introduction.
