Jamie Pommersheim gave a general formula for $c_1$ in his 1993 paper in Math. Ann. for the case of a tetrahedron. So if you can easily triangulate your polytope, this might be useful.
If you're "only" interested in bounds, you might want to look at the Ehrhart series instead, i.e., the generating function of the Ehrhart polynomial. This is a rational function with denominator (1-x)^4, so the information encoded in the numerator is the same information encoded in the Ehrhart polynomial (in fact, it's a linear transformation). A famous theorem of Stanley states that the numerator coefficients of the Ehrhart series are nonnegative, and of course this gives you inequalities among the coefficients of the Ehrhart polynomial. For more inequalities of this type, check out Alan Stapledon's work (e.g., https://arxiv.org/abs/0904.3035 or https://arxiv.org/abs/0801.0873).
(And thanks for your kind words, Andres.)
