There are interesting extensions of the problem of determining a joint probability with known marginals. On the one hand, one may impose size constraints on the joint probabilities. On the other, one may impose additional constraints like the expected values of known random variables. If we think of the marginal probabilities as demands or supplies, and of the joint probability as the fraction of the supplies to be shipped from the production sites to the demand sites, instead of joint probabilities we can think of transportation policies. Clearly, fixing the cost of a transportation policy is equivalent to an integral constraints upon the joint probability. We will show how to solve the cost constrained transportation problem by means of the method of maximum entropy in the mean. We shall also show how this approach leads to an interior point like method to solve the associated linear programming problem. We shall also investigate some geometric structure the space of transportation policies, or joint probabilities or pixel space, using a Riemannian structure associated with the dual of the entropy used to determine bounds between probabilities or between transportation policies.