01159nas a2200121   4500008004300000245006200043210005800105260001300163520078100176100002300957700002100980856003601001       2010                        en_Ud  00aOn optimality of c-cyclically monotone transference plans0 aoptimality of ccyclically monotone transference plans  bElsevier3 aAbstract. 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 [7]. We emphasize the measurability assumption on the hidden structure of linear preorder, applied also to extremality and uniqueness problems. Resume. Dans la presente note nous decrivons brievement la construction introduite dans [7] a propos de l\\\'equivalence entre l\\\'optimalite d\\\'un plan de transport pour le probleme de Monge-Kantorovich et la condition de monotonie c-cyclique ainsi que d\\\'autres sujets que cela nous amene a aborder. Nous souhaitons mettre en evidence l\\\'hypothese de mesurabilite sur la structure sous-jacente de pre-ordre lineaire.1 aBianchini, Stefano1 aCaravenna, Laura  uhttp://hdl.handle.net/1963/4023