08:58duration 8 minutes 58 seconds
1 - Certifying infeasibility of a system of…
1 - Certifying infeasibility of a system of linear inequalities
03:54duration 3 minutes 54 seconds
1 - Complementary Slackness
07:50duration 7 minutes 50 seconds
1 - Dual problem in general
04:54duration 4 minutes 54 seconds
1 - Fourier-Motzkin elimination
05:28duration 5 minutes 28 seconds
1 - Fundamental Theorem of Linear Programming
05:07duration 5 minutes 7 seconds
1 - Linear Programming Basics
03:31duration 3 minutes 31 seconds
1 - System of linear inequalities example
05:10duration 5 minutes 10 seconds
2 - Convex hull
07:42duration 7 minutes 42 seconds
2 - Convex sets
04:24duration 4 minutes 24 seconds
2 - Carathéodory's Theorem
04:30duration 4 minutes 30 seconds
2 - Optimizing a linear function
02:32duration 2 minutes 32 seconds
2 - Polyhedra
03:34duration 3 minutes 34 seconds
2 - Polytopes
04:12duration 4 minutes 12 seconds
2 - Representations of polytopes
06:25duration 6 minutes 25 seconds
2 - Polyhedral cones
03:53duration 3 minutes 53 seconds
2 - Separating hyperplane theorem - special case
02:09duration 2 minutes 9 seconds
3 - Affine independence
04:57duration 4 minutes 57 seconds
3 - Affine subspace and affine hull
05:52duration 5 minutes 52 seconds
3 - Facets
05:12duration 5 minutes 12 seconds
3 - Finding the dimension of a polyhedron
07:14duration 7 minutes 14 seconds
3 - Faces
02:59duration 2 minutes 59 seconds
3 - Subspace of R^n as nullspace
05:45duration 5 minutes 45 seconds
4 - Chvátal closure
4 - Integer hull
07:35duration 7 minutes 35 seconds
4 - Linear diophantine equations
05:26duration 5 minutes 26 seconds
4 - Integral polyhedra
06:10duration 6 minutes 10 seconds
4 - Meyer's Theorem for rational polyhedra
03:05duration 3 minutes 5 seconds
4 - Total dual integrality