# Formula for volume of a convex polytope

So I've been searching around the internet for some answers to this, but I currently have a set of linear constraints: $$Ax = b, Cx \le d$$ for matrices $$A \in \mathbb{R}^{n \times m}$$, $$b\in \mathbb{R}^{n}$$, $$C \in \mathbb{R}^{p \times m}$$, and $$d \in \mathbb{R}^{p}$$. I would like to deduce a formula for the volume of the set of feasible $$x$$:s that satisfy these constraints. It would be great if anyone could point me in a good direction, maybe this can't be solved analytically, in this case, maybe there is an approximation?