  We demonstrate an iterative scheme to approximate the optimal transportation
problem with a discrete target measure under certain standard conditions on the
cost function. Additionally, we give a finite upper bound on the number of
iterations necessary for the scheme to terminate, in terms of the error
tolerance and number of points in the support of the discrete target measure.
