The Fréchet Contingency Array Problem is Max-Plus Linear

Simple item page
dc.creatorTruffet, Laurent
dc.date2009-04-15
dc.date.accessioned2026-07-07T13:04:10Z
dc.date.available2026-07-07T13:04:10Z
dc.descriptionIn this paper we show that the so-called array Fréchet problem in Probability/Statistics is (max, +)-linear. The upper bound of Fréchet is obtained using simple arguments from residuation theory and lattice distributivity. The lower bound is obtained as a loop invariant of a greedy algorithm. The algorithm is based on the max-plus linearity of the Fréchet problem and the Monge property of bivariate distribution.
dc.identifierhttps://arxiv.org/abs/0904.2244
dc.identifierhttp://arxiv.org/abs/0904.2244
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227066
dc.subjectOptimization and Control
dc.titleThe Fréchet Contingency Array Problem is Max-Plus Linear
dc.typetext

Files

Collections

arXiv