This course will intensively cover the theoretical, computational and application-directed aspects of linear programming problems. Also covered will be the solution methods and applications of large scale linear programming problems. Major topics include: Simplex method, revised simplex method, dual simplex method, duality theory, sensitivity analysis, Danzig-Wolfe decomposition method, numerical implementation, introduction to computational complexity, and introduction to polyhedral theory.