Computational Aspects of Linear Programming

In this chapter we shall be concerned with the development of a computationally efficient version of the simplex procedure for solving a primal linear program. Let us assume that we are faced with the now familiar problem of determining the maximum of $$f\left( X \right) = C'Xs.t.$$ $$AX = b,X0.$$ .