Kantorovich optimal transport problem (source code)

= Kantorovich optimal transport problem
{c}

The Kantorovich problem minimizes $\int c(x,y)\,d\pi(x,y)$ over <transport plans> $\pi$ with <marginal distributions> $\mu,\nu$. It relaxes the <Monge optimal transport problem> by allowing source mass to split among destinations.