A generalized dual maximizer for the Monge--Kantorovich transport problem

A new abstract characterization of the optimal plans is obtained in the case where the cost function takes infinite values.. It leads us to new explicit sufficient and

Our signature method is a variant of Balinski's [3] compétitive (dual) simplex algorithm. It constructs rooted trees that have precisely the same primai structure as Balinski's

BAKEL’MAN, The Dirichlet problem for the elliptic n-dimensional Monge-Ampère equations and related problems in the theory of quasilinear equations, Proceedings. of

In particular, a topological space is arcwise connected (resp. locally arcwise connected), if and only if every couple of points in is connected by some path [a , b] ⊂ (resp.

A new abstract characterization of the optimal plans is obtained in the case where the cost function takes infinite values.. It leads us to new explicit sufficient and necessary

A. To nd a zero of a maximal monotone operator, an exten- sion of the Auxiliary Problem Principle to nonsymmetric auxiliary oper- ators is proposed. The main convergence result

In Section 4 we choose one such finite plan π 0 which need not be an optimal plan and prove a dual attainment result for a modified Monge–Kantorovich problem which is restricted to

As an application, we show that the set of points which are displaced at maximal distance by a “locally optimal” transport plan is shared by all the other optimal transport plans,