This text offers a look at simplex-based as well as the more recent interior point techniques for solving linear programming problems. It includes details of the primal and dual simplex methods with the primal-dual, composite and steepest edge simplex algorithms.