Linear Programming 47: Optimal transport

Linear Programming 47: Optimal transport

Abstract: We introduce optimal transport (i.e. the Wasserstein, Kantarovich-Rubinstein, or earth mover's distance), and hint at its relationship to linear programming.

This video accompanies the class "Linear Programming and Network Flows" at Colorado State University

We are following the book "Understanding and Using Linear Programming" by Jirí Matoušek and Bernd Gärtner

Our course notes are available at