2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/130673We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize those graphs whose cut polytopes are compressed and discuss consequences for studying linear programming relaxations in statistical disclosure limitation.14 pagesCombinatoricsOptimization and ControlStatistics Theorytext