forum.polymake.org

A simple question: If v is a point in a polytope P, I would like to find an explicit convex combination of the vertices of P which equals v. Additionally suppose that we want to find an optimal decomposition into d+1 points, where d is the dimension of P.

Are there functions in polymake that do these things?

Thanks!

That can be solved in terms of a linear program. And, yes, via its many interfaces polymake can solve linear programs.