Lectures related to Schönhardt polyhedron

Covers the basics of linear optimization, including equations, polyhedrons, feasible directions, and optimal solutions.

Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.