StefanWeltge

For a set $X$ of integer points, the relaxation complexity $\operatorname{rc}(X)$ is the smallest number of facets of any polyhedron P whose integer points are precisely those of X. In this paper, we focus on the case where X is the discrete standard simplex $\Delta_d = \{0, e_1, ..., e_d\}$. We show that $\operatorname{rc}(\Delta_d) = …