This Note deals with the equivalence between the optimality of a transport plan for the Monge-Kantorovich problem and the condition of c-cyclical monotonicity, as an outcome of the construction in Bianchini and Caravenna (2009) [7]. We emphasize the measurability assumption on the hidden structure of linear preorder, applied also to extremality and uniqueness problems among the family of transport plans.
On optimality of c-cyclically monotone transference plans
CARAVENNA, LAURA
2010
Abstract
This Note deals with the equivalence between the optimality of a transport plan for the Monge-Kantorovich problem and the condition of c-cyclical monotonicity, as an outcome of the construction in Bianchini and Caravenna (2009) [7]. We emphasize the measurability assumption on the hidden structure of linear preorder, applied also to extremality and uniqueness problems among the family of transport plans.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Bianchini2010p36872010On optimality of c-cyclically monotone.pdf
accesso aperto
Tipologia:
Published (publisher's version)
Licenza:
Accesso libero
Dimensione
167.44 kB
Formato
Adobe PDF
|
167.44 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.