Network flow problems. Interior point methods. 2 Aug 24 Linear Programming Problems and Examples. ch. 1 3 Aug 26 Simplex method: basics ch. 2 4 Aug 29 Simplex algorithm: pivoting and termination. ch.

About the same time, he invented the “simplex method,” an algorithm for solving linear programming problems. “The virtually simultaneous development of linear programming and computers led ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.