ABSTRACT
This chapter deals with several additional computational procedures that are commonly used in linear programming. The revised simplex method is similar to the primal simplex method. As suggested by the example, the revised simplex procedure often requires more computations in a single iteration than does the primal simplex method. The primary reason for the use of the revised simplex procedure is the reduction in the amount of information that must be retained during the iterations. The chapter discusses a variation of the revised simplex procedure known as the product form of the inverse. The method is used primarily because it requires less computer storage than does the standard revised simplex procedure. The revised simplex procedure starts with an admissible basis and a basic feasible solution. The chapter discusses improvements in the revised simplex procedure for such applications.
