INEG 61103 — Linear Optimization
A precise treatment of linear programming. Theory of convex sets, linear inequalities; development of the simplex method; duality theory; post optimality application and interpretation. Variants of the simplex methods and interior-point algorithms are discussed. Prerequisite: INEG 56103 . (Typically offered: Fall)
Prerequisites: INEG 56103