Linear Optimization Theory

This course is an introduction to theory of linear programming (focused on development of theory and algorithms with only a limited coverage of examples and applications), a basic component of optimization theory. Topics include: basic theory (fundamental theorem of LP, equivalence of basic feasible solutions and extreme points, duality and sensitivity results), simplex algorithm and its variations, and special applications to transportation and network problems.