  We study a tensor optimal transport (TOT) problem for $d\ge 2$ discrete
measures. This is a linear programming problem on $d$-tensors. We introduces an
interior point method (ipm) for $d$-TOT with a corresponding barrier function.
Using a "short-step" ipm following central path within $\varepsilon$ precision
we estimate the number of iterations.
