2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/227066In 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.Optimization and Controltext