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.
Titolo: | On optimality of c-cyclically monotone transference plans |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
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. |
Handle: | http://hdl.handle.net/11577/3146968 |
Appare nelle tipologie: | 01.01 - Articolo in rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.