Optimal Controlled Transports with Free End Times Subject to Import/Export Tariffs
Samer Dweik, Nassif Ghoussoub, Aaron Zeff Palmer

TL;DR
This paper develops a dual variational framework for optimal mass transportation with free end-times, incorporating import/export tariffs, and establishes existence and solution descriptions for the primal and Eulerian formulations.
Contribution
It introduces a Kantorovich-like dual principle for transport problems with tariffs and free end-times, and links primal and Eulerian formulations via Hamilton-Jacobi-Bellman inequalities.
Findings
Established a dual variational principle considering tariffs.
Proved existence of solutions for primal and Eulerian problems.
Derived Eulerian formulation involving Hamilton-Jacobi-Bellman inequalities.
Abstract
We analyze controlled mass transportation plans with free end-time that minimize the transport cost induced by the generating function of a Lagrangian within a bounded domain, in addition to costs incurred as export and import tariffs at entry and exit points on the boundary. We exhibit a dual variational principle \`a la Kantorovich, that takes into consideration the additional tariffs. We then show that the primal optimal transport problem has an equivalent Eulerian formulation whose dual involves the resolution of a Hamilton-Jacobi-Bellman quasi-variational inequality with non-homogeneous boundary conditions. This allows us to prove existence and to describe the solutions for both the primal optimization problem and its Eulerian counterpart.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Optimal controlled transports with free end times subject to import/export tariffs
Samer Dweik, Nassif Ghoussoub and Aaron Zeff Palmer
Department of Mathematics, University of British Columbia, Vancouver BC Canada V6T 1Z2.
[email protected], [email protected], [email protected]
Abstract.
We analyze controlled mass transportation plans with free end-time that minimize the transport cost induced by the generating function of a Lagrangian within a bounded domain, in addition to costs incurred as export and import tariffs at entry and exit points on the boundary. We exhibit a dual variational principle à la Kantorovich, that takes into consideration the additional tariffs. We then show that the primal optimal transport problem has an equivalent Eulerian formulation whose dual involves the resolution of a Hamilton-Jacobi-Bellman quasi-variational inequality with non-homogeneous boundary conditions. This allows us to prove existence and to describe the solutions for both the primal optimization problem and its Eulerian counterpart.
Contents
- 1 Introduction
- 2 Free end-time optimal control problem: preliminaries
- 3 Kantorovich duality with boundary tariffs
- 4 Eulerian formulation for transports involving tariffs
- 5 Uniqueness of optimal transport plans and associated stopping times
- 6 The general import/export case.
- 7 An example
1. Introduction
Let be a positive measure on a bounded domain of that encodes both the location and the supply of goods produced by certain factories, and let be another positive measure on that represents the location of some customers as well as their consumption requirement for these goods. Assuming a function describes the transport cost of a mass unit to , and subject to the mass balance condition standard Monge-Kantorovich theory formulates the least costly transport plan as a solution for the following optimization problem,
[TABLE]
where
[TABLE]
and and are the two marginals of on . Note that if is continuous, Problem (1.1) is the relaxed Kantorovich version of the so-called Monge Problem [17],
[TABLE]
where means that the transformation pushes onto , i.e., for every Borel subset . Under mild conditions on the transport cost , Problem (1.1) has the following dual formulation (see, for instance, [19, 20]):
[TABLE]
We refer to [2, 4, 5, 19, 20] for an introduction to optimal transport theory, its history, and its main results.
Our goal in this paper is to study a variant of this problem already considered by several authors [9, 10, 11, 12, 16], namely the case where one considers transport plans that move all the products in and cover all the needs of the consumers in , with the possibility of importing and exporting products across the boundary of , provided export (respect import) tariffs are paid in addition to the transport cost: one is then charged an extra cost for each unit that comes out from a point (the export tax) and a tariff for each unit that enters at the point (the import tax). Note that the usual balance condition on is not imposed here since we can import and export through the boundary at will, if necessary. This means that can be considered an infinite reserve/repository from which one can import as much product as need be, and to which one can export as much mass as necessary, provided that one pays the import/export taxes in addition to the transportation cost. To formulate the problem, one considers the set
[TABLE]
and minimizes the quantity
[TABLE]
It is important to assume the following “no arbitrage condition,” which makes sure that there is no advantage to transporting goods from the boundary to other boundary locations:
[TABLE]
Just like in classical Monge-Kantorovich theory, Problem (1.3) has then a dual formulation where the Kantorovich potentials now satisfy certain boundary conditions. More precisely, one can show that
[TABLE]
where
[TABLE]
In this paper, we shall conisder transport costs given by the minimal value of some optimal control problem between and . Classical Monge-Kantorovich problems associated with such costs were considered by Agrachev and Lee [1] for trajectories with fixed end-times, and by Ghoussoub-Kim-Palmer [15] for the case where end-times also need to be determined. It is the latter set-up that we shall consider here, that is when
[TABLE]
where is a Lagrangian, is a set of controls and is a functional that determines the dynamics. This leads us to formulate an Eulerian version of the problem that dynamically describes the movement of goods. It also calls for finding optimal stopping times for their delivery.
To give an Eulerian formulation for the primal problem (1.3), we follow ideas in [15] and consider the set
[TABLE]
where the equations for are expressed formally as
[TABLE]
This means that the boundary parts of and are now unknown (in fact, these two positive measures represent the import/export masses on the boundary ). The Eulerian formulation of Problem (1.3) then becomes
[TABLE]
Similarly to [15], we then consider the dual of the Eulerian formulation (1.8), which involves the resolution of the following Hamilton-Jacobi-Bellman quasi-variational inequality but, now, with certain non-homogeneous boundary conditions:
[TABLE]
The second dual problem is now,
[TABLE]
The first goal of this paper is to prove that –under natural conditions– the following equalities hold,
[TABLE]
We will then show, under additional hypotheses, that minimizers of and are given by transport maps, determined by a Hamiltonian flow terminating along the free boundary of the optimal dual potentials.
We note that the above model is a particular case of a more general setting, where we can consider the reserve mass is taken from a prescribed set with cost , and can be deposited in the set with cost , where and are two compact sets of . The admissible set of transport plans is then
[TABLE]
and the new variational problem becomes
[TABLE]
Again, we assume that the costs and satisfy the no arbitrage assumption (1.4), which becomes
[TABLE]
The same analysis as above can be carried out and a sketch is given in Section 6. Note that the above model is the particular case where .
Finally, in Section 7, a one-dimensional example is presented to demonstrate how the structure of the problem can be utilized in a solution.
This paper is organized as follows. In Section 2, we introduce the control problem needed to define the transportation cost and the conditions under which the existence of optimal trajectories and the continuity of the transport cost are guaranteed. In Section 3, we analyze in details the primal transportation problem with tariff costs, prove existence of an optimal transport plan and give a proof for the first duality principle. In Section 4, we introduce an equivalent Eulerian formulation and its dual, establish the existence of an optimal admissible pair and show the equivalence with the primal problem. In Section 5 we identify the optimal stopping times, while in Section 6 we sketch a proof of the more general setting where the tariff costs (resp., ) are incurred when goods are taken from (resp., deposited in) prescribed locations (resp., ). Section 7 presents a simple one-dimensional example.
2. Free end-time optimal control problem: preliminaries
In this section, we consider the optimal control problem that we will use to define the transport cost , between two points and . We assume that the trajectory from a point to another one is submitted to a non-autonomous control system, the time-dependence of the dynamic comes, for instance, from the interaction between particles. This control problem is said to be with free end time since the terminal time of the trajectories from to is not fixed, but is the first time at which they reach the point . So, we consider control systems whose state equation is of the form
[TABLE]
where is the state, the continuous function is called the dynamic of the system, , and is a measurable function (which is called a control and is the control set). We list some basic assumptions on the dynamic and the control set :
(H0) The control set is compact,
(H1) is bounded, i.e., ,
(H2) is continuous with respect to and is -Lipschitz in the other variables,
i.e., .
Note that Assumption (H2) ensures the existence of a unique global solution to the state equation (2.1) for any choice of and . We shall denote such a solution of (2.1) by and we call it an admissible trajectory of the system, corresponding to the initial condition and to the control . For a given trajectory of (2.1), we set
[TABLE]
with the convention that if , for all .
Now, our optimal control problem consists of choosing the control strategy in the state equation (2.1) in order to minimize a given cost given by a Lagrangian. For that, consider to be a given continuous function. For every , we minimize the cost
[TABLE]
among all controls . A control and the corresponding trajectory are called optimal from to if minimizes (2.2). Note that it is not clear if for every , there is always at least one admissible trajectory joining them. To avoid this situation, we assume the following extra condition (see also [6]):
(H3) The convex hull of contains an open neighborhood of the origin,
i.e.,
Lemma 2.1**.**
Let be a compact domain. Then, there exists a constant depending only on and such that, for all , there is some control such that
Proof.
Fix . By (H3), there exists a constant control such that , for every . Set , where and is to be chosen later. But again, there is some constant control such that , for every . Set , where . In this way, we get three sequences and such that: , for every , and , where . Using (H1) & (H2), for every , we have:
[TABLE]
Then, we get
[TABLE]
Set
[TABLE]
We then have Now, define
[TABLE]
Observe that
[TABLE]
On the other hand, we see easily that . Consequently, we get
[TABLE]
and we are done. ∎
We now introduce assumptions on the Lagrangian that will be needed in the sequel:
(H4) There exist two constants such that
[TABLE]
(H5) There exists a constant such that
[TABLE]
(H6) For any , the set
[TABLE]
Under assumptions (H0), (H1), (H2), (H3), (H4) and (H6), we have the following existence result. The proof is essentially based on some arguments used in [6].
Proposition 2.2**.**
For every and for all , there exists an optimal control that minimizes the cost defined in (2.2).
Proof.
Let be a minimizing sequence. For simplicity, set and . By (H4), it is clear that, up to extracting subsequences, and with . We first prove that is an admissible trajectory. Fix . By (H2), for all , we have
[TABLE]
Fix . For and large enough, this implies that
[TABLE]
By using (H6), we get
[TABLE]
Letting , we obtain
[TABLE]
Letting , we get
[TABLE]
Since is arbitrary, we infer that . This is sufficient to say that is an admissible trajectory, i.e. there is some control such that .
Now consider the augmented control system with state space , where and , where and . Recalling (H6), one can check easily that the set is convex, for all . Let be the trajectory which corresponds to initial condition at time and to the controls . Then, we have , where
[TABLE]
As is convex, for all , then one can prove as before that there is a control such that , where is an admissible trajectory which corresponds to initial condition at time and to the control . Yet, one has
[TABLE]
Recalling that and and using (H4), we infer that
[TABLE]
This completes the proof that is an optimal trajectory from to and that is the corresponding optimal control. ∎
Next, we want to give a result about the Lipschitz continuity of the transport cost. This result is standard but we prove it for completeness (see also [6] for similar results). Set
[TABLE]
Proposition 2.3**.**
Under Assumptions (H0)-(H6), the transport cost is Lipschitz continuous in .
Proof.
Let . Suppose that and let be an optimal control from to starting at time [math]. Set and let be a control such that (see Lemma 2.1). Set
[TABLE]
Then, we have
[TABLE]
On the other hand, let . Suppose that and let be an optimal control from to , at time [math]. There are two possibilities: or . First, assume that . Set and let be a control such that . Set
[TABLE]
Then, we have
[TABLE]
But,
[TABLE]
Hence, and consequently, . The case where can be treated in a similar fashion. ∎
We also have the following stability-optimality result:
Proposition 2.4**.**
Let and be two sequences such that and . If is an optimal trajectory from to , for every , then, up to a subsequence, , where is an optimal trajectory from to .
Proof.
First, it is easy to see that there is some such that . Set , where is the corresponding optimal control. Using (H4) & Lemma 2.1, we infer that . Recalling the proof of Proposition 2.2, this is an admissible trajectory from to (there is some control such that with ). Recalling Proposition 2.2 and using Proposition 2.3, one can show the following:
[TABLE]
This implies that is optimal from to . Moreover, by (H4), we also get that and so, . ∎
Now consider the following multi-valued map :
[TABLE]
The following is a direct consequence of Proposition 2.4 and a standard selection theorem (e.g., see [7]).
Corollary 2.5**.**
The multi-valued map has a closed graph and therefore has a Borel selector function which will be denoted, in the sequel, by .
We shall set the notation
[TABLE]
which will eventually be used in Section 4.
3. Kantorovich duality with boundary tariffs
In this section, we analyze Problem (1.3), its dual principle, and a decomposition of the optimal transport plan into three components according to whether they never visit the boundary, whether they get to it, or if they come from it.
Set
[TABLE]
and consider the following problems:
[TABLE]
and
[TABLE]
In this section, we shall assume that the cost is Lipschitz continuous on and that the two boundary costs and are in and satisfy the inequality:
[TABLE]
Under these assumptions, we have the following result.
Proposition 3.1**.**
The infimum in Problem (3.1) is attained, and the following duality formula holds:
[TABLE]
Proof.
Set
[TABLE]
is then continuous on with respect to the weak∗ convergence of measures. Indeed, if is a sequence in such that , then, for every , there exists such that
[TABLE]
where and . As and are continuous on , it follows that
On the other hand, we observe that if and , then also belongs to . In addition, we have
[TABLE]
By (3.3), we get that
[TABLE]
Now take a minimizing sequence for (3.1). We can suppose that In this case, we get
[TABLE]
Hence, there exist a subsequence and a plan such that . But, the continuity of the total cost implies that this is a minimizer for (3.1).
We now establish the duality formula. A proof of the duality formula for a general Lipschitz cost based on the Fenchel-Rockafellar duality was given in [16]. Here, we give an alternative proof based on a perturbative argument used in [11, 19]. Define the functional as follows:
[TABLE]
Note that . This follows immediately from the fact that for a maximizing sequence , we can always assume them to share the same Lipschitz constant as . In fact, if we replace by where , for every , then the constraints are preserved and the integrals increased. We can then assume that they are uniformly bounded in such a way that Ascoli-Arzelà’s Theorem applies. Next, we show that is convex and lower semi-continuous.
For the convexity : take and and, let and be their optimal potentials. Set
[TABLE]
and
[TABLE]
As
[TABLE]
[TABLE]
and
[TABLE]
then
[TABLE]
As a consequence of that, we infer that is admissible in the max defining and then,
[TABLE]
For the semi-continuity : take and uniformly on . Let be a subsequence such that (for simplicity of notation, we still denote this subsequence by ) and let be their corresponding optimal potentials. As have the same Lipschitz constant as the transport cost and are equibounded, then, by Ascoli-Arzelà’s Theorem, there are two continuous functions and a subsequence such that and uniformly in . As
[TABLE]
then
[TABLE]
Consequently, the pair is admissible in the max defining and so, one has
[TABLE]
Since is convex and lower semi-continuous, it is equal to its double Legendre transform, i.e., , and in particular, . By its definition, we have
[TABLE]
We now compute . Take in , then we have
[TABLE]
which is equal to:
[TABLE]
If , then there exists such that and and therefore
[TABLE]
Similarly if Now suppose that . As we should choose the largest possible and , i.e. and , for all . Hence, we get
[TABLE]
and therefore,
[TABLE]
Consequently,
[TABLE]
Our aim now is to decompose the transport problem (3.1) into three subproblems: the first one will be for transporting mass from the interior of the domain to the interior, making it a standard Monge-Kantorovich transport; the second transports mass from the interior to the boundary and the last one moves mass from the boundary to the interior.
To do that, we fix a minimizer for (3.1) and denote by and the two positive measures concentrated on the boundary of such that and (this means that encode the import/export masses). Set
[TABLE]
and
[TABLE]
Recalling the proof of Proposition 3.1, we can assume that the boundary-boundary part (this is always possible thanks to our assumption (1.4)). Now, let (resp., ) be a Borel selector function of the following possibly multivalued set of minimizers
[TABLE]
(resp.,
[TABLE]
Note that such a selector exists since their graph is closed and so one can use a selection theorem, such as in [7]. The following proposition is straightforward.
Proposition 3.2**.**
Consider the following three transport problems:
[TABLE]
[TABLE]
and
[TABLE]
Then, , and solve (3.7), (3.8) and (3.9), respectively. Moreover, the optimal transport plan from the interior to the boundary and solves
[TABLE]
Similarly, the optimal transport plan from the boundary to the interior and solves
[TABLE]
We finish this section by the following result.
Proposition 3.3**.**
Let be a maximizer of the dual problem (1.6) and let be an optimal transport plan for (1.3). Let and be the two positive measures on such that and . Then, we have the following
[TABLE]
Proof.
First, it is clear that solves
[TABLE]
Now, let be a maximizer for the dual problem of (3.12):
[TABLE]
We have
[TABLE]
But, on . Then, we get
[TABLE]
From the duality result (see Proposition 3.1), we conclude the proof (we note that this shows at the same time that the pair solves (3.13)). ∎
4. Eulerian formulation for transports involving tariffs
In this section, our aim is to find an equivalent Eulerian formulation for (3.1). We shall assume that all assumptions (H0)-(H6) hold and so, by Section 2, for every , we can associate an optimal trajectory , an optimal control , and an end time to get from to , in such a way that the three maps , and are chosen to be measurable. We first introduce the following:
Definition 4.1**.**
Say that is a density process and is a stopping distribution between two given finite positive measures and on , if they satisfy the following:
[TABLE]
and
[TABLE]
The set of such pairs will be denoted by .
Consider now the transport subproblems (3.7), (3.8) & (3.9). Our goal is to construct, for each of these subproblems, an admissible pair of density process and stopping distributions (resp. and ) from the optimal transport plan (resp. and ). More precisely, we have the following:
Lemma 4.1**.**
There exists an admissible pair such that
[TABLE]
Proof.
Let be an optimal transport plan between and and define the pair as follows:
[TABLE]
and for all ,
[TABLE]
One can easily check that the pair . Indeed, for every and , we have
[TABLE]
and
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Moreover, we have
[TABLE]
∎
Lemma 4.2**.**
There exists an admissible pair such that the following holds
[TABLE]
Proof.
Define the pair consisting of a density process and a stopping distribution as follows:
[TABLE]
while, for all ,
[TABLE]
We have, for every ,
[TABLE]
and, for every ,
[TABLE]
[TABLE]
[TABLE]
On the other hand, we have
[TABLE]
This completes the proof. ∎
Lemma 4.3**.**
There exists an admissible pair such that we have
[TABLE]
Proof.
Define the pair consisting of a density process and a stopping distribution as follows:
[TABLE]
while, for all ,
[TABLE]
One has
[TABLE]
and
[TABLE]
[TABLE]
Moreover, we have
[TABLE]
Now, set
[TABLE]
In other words, a pair belongs to if and only if we have the following: for all ,
[TABLE]
while, for all such that on , one has
[TABLE]
Now, we have the following result.
Proposition 4.4**.**
There exists an admissible pair such that
[TABLE]
Consequently,
[TABLE]
Proof.
Set From Lemmas 4.1, 4.2 & 4.3, we have for all
[TABLE]
while, for all such that on , one has
[TABLE]
On the other hand, by Lemmas 4.1, 4.2 & 4.3, we get
[TABLE]
This completes the proof. ∎
We now recall the Eulerian dual problem
[TABLE]
where
[TABLE]
and prove the following.
Proposition 4.5**.**
Under the above assumptions, we have
[TABLE]
Proof.
Set for all ,
[TABLE]
It is well known that is a viscosity solution of the following Hamilton-Jacobi-Bellman quasi-variational inequality (see, for instance, [3]):
[TABLE]
where
[TABLE]
Let be an admissible pair of the dual problem in (1.6). By the definition of , it is clear that we have
[TABLE]
On the other hand, it is also known [3] that the viscosity solution is the infimum of all supersolutions to
[TABLE]
As a consequence, we get
[TABLE]
On the other hand, we have the following:
Proposition 4.6**.**
The following inequality holds:
[TABLE]
Proof.
For an admissible , there are two nonnegative measures and which are concentrated on the boundary such that . Let satisfy (4.5) with and . Then, we have
[TABLE]
This implies that
[TABLE]
This concludes the proof. ∎
Finally, we obtain the following.
Theorem 4.7**.**
Under the above assumptions on , , and ,
- (1)
The following equalities hold:
[TABLE] 2. (2)
Let be an optimal plan for and its associated decomposition . Then, the corresponding admissible pairs and are, respectively, solutions for the Eulerian problems:
[TABLE]
[TABLE]
and
[TABLE] 3. (3)
The pair , where and , solves the Eulerian problem
[TABLE]
Proof.
For (4.10) it suffices to combine (3.4), (4.3), (4.6) and (4.8). The rest follows directly from the optimality of the transport plan , the optimalities of and in problems 3.7, 3.8 & 3.9, respectively, the equalities in (4.10), as well as Lemmas 4.1, 4.2 & 4.3 and Proposition 4.4. ∎
5. Uniqueness of optimal transport plans and associated stopping times
In this section, we show that, under additional assumptions on the Hamiltonian , the optimal transport plan (resp. stopping plan) (from interior to interior) (resp. ) is a transport map (resp. a stopping time). More precisely, we prove that the optimal transport plan is concentrated on a graph and the optimal stopping distribution will be concentrated on a graph , as soon as the source measure is absolutely continuous with respect to the Lebesgue measure . The map is constructed by solution to the Hamiltonian flow with the end time determined by the Pontryagin transversality condition. The argument will be sketched as this is a straight forward extension of the result of [15]. We also show that the maps and are unique under these assumptions, and given by similar constructions.
Let be a solution for the dual problem (1.8) between and . Recall that the potential is given by the following formula (for more details about the following optimal control problem with free stopping time, we refer to [3]):
[TABLE]
Let be an optimal trajectory from a point to another one , be the corresponding optimal control and be the corresponding stopping time. First, assume that:
(H7) The Hamiltonian is ,
(H8) has a unique maximizer for all .
From the Pontryagin maximum principle (see, for instance, [8, 18]), for any that minimize the cost
[TABLE]
there is a Lipschitz continuous arc that solves:
[TABLE]
and satisfies the maximum principle:
[TABLE]
with boundary conditions at points of differentiability of and (see, for instance, [6]):
[TABLE]
and the transversality condition:
[TABLE]
It follows that for a.e.
[TABLE]
In addition, we suppose that
(H9) on
Then, we get
[TABLE]
Now, let us assume the following monotonicity condition on the running cost with respect to time:
(H10) or on
Then, this implies that along an optimal trajectory , we have, under the assumption (H10), the following:
[TABLE]
On the other hand, we have that, for initial points where is differentiable, the pair is the unique solution for the following Hamiltonian system:
[TABLE]
Hence, the stopping time is uniquely determined by (almost everywhere): while the endpoint of the trajectory is given by . This constructs the maps (depending on through the initial condition of ), where whenever and when .
In other words, the optimal transport plan is concentrated on a graph as soon as the source measure is absolutely continuous with respect to the Lebesgue measure (for the case we also require that and are disjoint to handle the mass stopping at ). Moreover, the optimal stopping distribution is concentrated on the graph . Then, we have
[TABLE]
and
[TABLE]
Now, we may assume that
[TABLE]
because replacing with this infimum can only increase the dual value. First, let us suppose that on . In this case, it is easy to see that is strictly decreasing. Then, we define the free boundary function as follows:
[TABLE]
Let be an optimal trajectory with and suppose that is differentiable at (which is the case for a.e. ). Then, one can show that the following holds (see [15] for more details):
[TABLE]
But, recalling (5.1) and the terminal condition from the Pontryagin maximum principle that , we infer that In this way, the pair , where is the associated dual arc with , turns out to be the unique solution of the following system (with reverse time):
[TABLE]
We may now define the map , which is the inverse of when , and is the unique map when . In other words, the optimal transport plan is concentrated on a graph and the optimal stopping distribution is concentrated on a graph , provided that the target measure . Similarly, one can prove the same result in the case where on . The only difference is that, now, the free boundary function becomes
[TABLE]
In order to disregard any transport of goods from boundary onto boundary consumers, we suppose now that
[TABLE]
Then, we have the following:
Theorem 5.1**.**
Suppose that and that (5.4) holds along with (H0)-(H10) with . Then, Problem (1.3) has a unique optimal transport plan, where is supported on the set and is supported on . In the case that , the result holds where the unique optimal transport plan stops all overlapping mass of along the diagonal, and the remainder is supported on the graphs of and as above.
Proof.
The proof has essentially been done in the discussion leading up to the theorem. If is in the support of then we have that and since
[TABLE]
for all , we find that there is an optimal trajectory with and . When we have from the Pontryagin maximum principle a dual arc satisfying and at points of differentiabiltiy of and , which occur almost everywhere by Rademacher’s theorem. As discussed above, this allows identifying with the unique solution to the Hamiltonian system, either forward in time (5.2) or with reverse time (5.3). In the first case we have realized the support of as a graph, and in the second case we realize the support of as a graph.
To handle the possibility of , we note this implies that . For the case that , for all and thus . Since the Hamiltonian can only decrease along the trajectory the only solution is with . In the case that , there is the possibility that and there is . In fact, in this case, if there is overlapping mass of and it most stop at and the remainder will stop at . If the overlapping mass does not stop, then there in the support of with . We can acheive the same transport with lower cost by swapping the values of at and with and . Indeed, with the concatenated trajectory from to we have
[TABLE]
showing that the optimizer must stop all overlapping mass at .
We have now characterized the support of as living on the graph of a function, from which it follows that these measures are unique from the fact that the functional in (1.3) is linear with convex constraints. Uniqueness of follows similarly. ∎
6. The general import/export case.
In this section, we briefly consider the variation of the problem where the reserve mass is taken from a set with cost and deposited in the set with cost , where and are two compact sets of . This variation is directly equivalent to the problem we have studied for . We define the admissible set of transport plans for this variant to be
[TABLE]
Then, we consider the following variant of (3.1)
[TABLE]
Again, we assume that the costs and satisfy the no arbitrage assumption (1.4), which becomes
[TABLE]
As in Proposition 3.1, we get, under this assumption, the following duality result:
[TABLE]
On the other hand, one can also find an Eulerian formulation which becomes:
[TABLE]
where
[TABLE]
Finally, the dual of the Eulerian problem can be expressed as:
[TABLE]
7. An example
We consider a simple one dimensional example where the particles move at unit speed and the cost depends only on the end time. We let , , and , where and is increasing. Let us consider the case where is the uniform distribution on to is uniform on . We suppose that
[TABLE]
(where could be a sufficiently large finite number). To satisfy the no-arbitrage condition, we require that
[TABLE]
The Hamiltonian is
[TABLE]
and the unique solution is easily found in the cases when either is strictly convex or is strictly concave.
Strictly increasing Lagrangian. Here, we assume that is strictly convex so that is strictly increasing. A simple ansatz for an optimal map is
[TABLE]
We have made the decomposition so that has density 1 on and has density on . The free boundary (end time) on is
[TABLE]
Now, we can solve from the equations,
[TABLE]
to get
[TABLE]
The total cost is
[TABLE]
which we differentiate with respect to to obtain the following optimality criteria
[TABLE]
which concurs with because the point happens to be in the support of .
It is now straightforward to calculate and verify that this is indeed the optimal solution. In Figure 1 we illustrate the primal and dual solutions for the case that , , in which case . Note that the continuation of outside of the support of is arbitrary so long as it is sufficiently small.
Strictly decreasing Lagrangian. We now assume that is strictly concave so that is strictly decreasing. The ansatz for an optimal map is similar, except the interior map reverses orientation,
[TABLE]
We find the free boundary to be
[TABLE]
and is solved on to be
[TABLE]
Similarly, we find optimality occurs when
[TABLE]
In Figure 2, we plot the solutions for , and , (so that ).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Agrachev and P. Lee , Optimal transportation under nonholonomic constraints , Transactions of the American Mathematical Society, volume 361, No 11, p. 6019–6047, 2009.
- 2[2] L. Ambrosio , Lecture notes on optimal transport problems in Mathematical aspects of evolving interfaces (Funchal, 2000) , 1-52, Lecture Notes in Math., 1812, Springer, Berlin, 2003.
- 3[3] M. Bardi and I. Capuzzo-Dolcetta , Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations , Modern Birkhäuser Classics, Birkhäuser Boston, 2008.
- 4[4] Y. Brenier and J. D. Benamou , A numerical method for the optimal mass transport problem and related problems, Contemporary Mathematics 226, Amer. Math. Soc., Providence, 1–11, 1999.
- 5[5] Y. Brenier and J. D. Benamou , A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem, Numer. Math. 84, 375–393, 2000.
- 6[6] P. Cannarsa and C. Sinestrari , Semiconcave functions, Hamilton-Jacobi equations, and optimal control , Progress in Nonlinear Differential Equations and their Applications, 58. Birkhäuser Boston, Inc., Boston, MA, 2004.
- 7[7] C. Castaing and M. Valadier, Convex analysis and measurable multifunctions. Springer-Verlag. Berlin. Heidelberg. New York 1977.
- 8[8] F. H. Clarke, Optimization and nonsmooth analysis , volume 5 of Classics in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, second edition, 1990.
