08:58 duration 8 minutes 58 seconds

1 - Certifying infeasibility of a system of…

1 - Certifying infeasibility of a system of linear inequalities

03:54 duration 3 minutes 54 seconds

1 - Complementary Slackness

07:50 duration 7 minutes 50 seconds

1 - Dual problem in general

04:54 duration 4 minutes 54 seconds

1 - Fourier-Motzkin elimination

05:28 duration 5 minutes 28 seconds

1 - Fundamental Theorem of Linear Programming

05:07 duration 5 minutes 7 seconds

1 - Linear Programming Basics

03:31 duration 3 minutes 31 seconds

1 - System of linear inequalities example

05:10 duration 5 minutes 10 seconds

2 - Convex hull

07:42 duration 7 minutes 42 seconds

2 - Convex sets

04:24 duration 4 minutes 24 seconds

2 - Carathéodory's Theorem

04:30 duration 4 minutes 30 seconds

2 - Optimizing a linear function

02:32 duration 2 minutes 32 seconds

2 - Polyhedra

03:34 duration 3 minutes 34 seconds

2 - Polytopes

04:12 duration 4 minutes 12 seconds

2 - Representations of polytopes

06:25 duration 6 minutes 25 seconds

2 - Polyhedral cones

03:53 duration 3 minutes 53 seconds

2 - Separating hyperplane theorem - special case

02:09 duration 2 minutes 9 seconds

3 - Affine independence

04:57 duration 4 minutes 57 seconds

3 - Affine subspace and affine hull

05:52 duration 5 minutes 52 seconds

3 - Facets

05:12 duration 5 minutes 12 seconds

3 - Finding the dimension of a polyhedron

07:14 duration 7 minutes 14 seconds

3 - Faces

02:59 duration 2 minutes 59 seconds

3 - Subspace of R^n as nullspace

05:45 duration 5 minutes 45 seconds

4 - Chvátal closure

4 - Integer hull

07:35 duration 7 minutes 35 seconds

4 - Linear diophantine equations

05:26 duration 5 minutes 26 seconds

4 - Integral polyhedra

06:10 duration 6 minutes 10 seconds

4 - Meyer's Theorem for rational polyhedra

03:05 duration 3 minutes 5 seconds

4 - Total dual integrality

Carleton University Media Portal | Support Documents