Linear programming: formulations, basic feasible solutions, simplex method, duality and complementary  slackness. Introduction to game theory. Integer programming: formulations, relaxations, Hungarian method for the assignment problem, total unimodularity, branch and bound, Gomory cuts. Network flows and applications. Introduction to dynamic programming. CVX software.