# highest dimension polyhedron

Hi,

I use the command Polyhedron(vertices = points) where points is an array to create a polyhedron in sage.

It works quite well for dimensions up to 12, i.e., each point in points consists of 12 bits, as the command takes 2-3 minutes even if the size of points is really large.

However, when the dimension increases over 12, things get really slow.

So what is the highest dimension polyhedron that sage can handle?

Thanks,

just for curiosity: what are the operations that you have to do with these polytopes? and can they be performed only with the Vrep? I ask because in my case its exactly the opposite: for some operations (e.g. support function calculus) it's 'enough' to have the Hrep, so i'm interested in adding a flag that turns-off the automatic computation of the complementary representation.. that's the behavior, for instance, in Matlab's Multi-parametric toolbox (MPT).

I use the Hrep of these points as a part of an MILP model in my optimization problem

@moati ok, I see, so in that case the Vrep-Hrep conversions are required.