An optimal matching problem with constraints

We deal with an optimal matching problem with constraints, that is, we want to transport two measures with the same total mass in R N to a given place (the target set), where they will match and in which we have constraints on the amount of matter we can take to points in the target set. This transport has to be done optimally, minimizing the total transport cost, that in our case is given by the sum of the Euclidean distances that each measure is transported. Here we show that such a problem has a solution. First, we solve the problem using mass transport arguments and next we perform a method to approximate the solution of the problem taking limit as p → ∞ in a p -Laplacian type variational problem. In the particular case in which the target set is contained in a hypersurface, we deal with an optimal transport problem through a membrane, that is, we want to transport two measures which are located in different locations separated by a membrane (the hypersurface) which only let through a predetermined amount of matter.