Following the method introduced by Evans y Gangbo to solve the classical Monge-Kantorovich mass transport problem, in this lecture we present two mass transport problems obtained as limit when p\to \infty of the solutions of some problem related with the p-Laplacian operator. The first one is an optimal matching problem that consists in transporting two commodities to a prescribed location, the target set in such a way that they match there and the total cost of the operation, measured in terms of the Euclidean distance that the commodities are transported, is minimized. We show that such a problem has a solution with matching measure concentrated on the boundary of the target set. Furthermore we perform a method to approximate the solution of the problem taking limit as p\to \infty in a system of PDE's of p-Laplacian type. The second problem consists in moving optimally (paying a transport cost given by the Euclidean distance) an amount of a commodity larger or equal than a fixed one to fulfill a demand also larger or equal than a fixed one, with the obligation of paying an extra cost of -g_1(x) for extra production of one unit at location x and an extra cost of g_2(y) for creating one unit of demand at y. The extra amounts of mass (commodity/demand) are unknowns of the problem. Our approach to this problem is by taking the limit as p\to\infty to a double obstacle problem (with obstacles g_1, g_2) for the p-Laplacian. In fact, under a certain natural constraint on the extra costs (that is equivalent to impose that the total optimal cost is bounded) we prove that this limit gives the extra material and extra demand needed for optimality and a Kantorovich potential for the mass transport problem involved.