Marginalization like a projection.
This paper studies the problem of marginalizing convex polytopes of probabilities represented by a set of constraints. This marginalization is obtained as a special case of projection on a specific subspace. An algorithm that projects a convex polytope on any subspace has been built and the expression of the subspace, where the projection must be made for obtaining the marginalization, has been calculated.