Theory of Linear Inequalities

3 Credit Hours

Theoretical foundations of linear and integer programming. Topics include representation of polyhedra, polarity, simplex and ellipsoid algorithms, diophantine equations, Hilbert bases, total dual integrality, and others.