08:58

1 - Certifying infeasibility of a system of…

1 - Certifying infeasibility of a system of linear inequalities

03:54

1 - Complementary Slackness

07:50

1 - Dual problem in general

04:54

1 - Fourier-Motzkin elimination

05:28

1 - Fundamental Theorem of Linear Programming

05:07

1 - Linear Programming Basics

03:31

1 - System of linear inequalities example

05:10

2 - Convex hull

07:42

2 - Convex sets

04:24

2 - Carathéodory's Theorem

04:30

2 - Optimizing a linear function

02:32

2 - Pointed polyhedra and lines

2 - Polyhedra

03:34

2 - Polytopes

04:12

2 - Representations of polytopes

06:25

2 - Polyhedral cones

03:53

2 - Separating hyperplane theorem - special case

02:09

3 - Affine independence

04:57

3 - Affine subspace and affine hull

05:52

3 - Facets

05:12

3 - Finding the dimension of a polyhedron

07:14

3 - Faces

02:59

3 - Subspace of R^n as nullspace

05:45

4 - Chvátal closure

4 - Integer hull

07:35

4 - Linear diophantine equations

05:26

4 - Integral polyhedra

06:10

4 - Meyer's Theorem for rational polyhedra

03:05

4 - Total dual integrality

Carleton University Media Portal | Support Documents