Dear all, I am defining a polytope in polymake through a set of linear inequalities and could compute the vertices also. In addition, I would like to sample the points in the polytope (similar to a hit-and-run sampling method). Is there a possibility to accomplish this in the polymake ? Many Thanks ...

Thank you for the suggestion. The model I am investigating is quite large but its possible to solve it with >4000 secs time threshold, but I have other models which are extremely large and the hope to solve it in all the three algorithms is extremely low. I have an (unbounded) polyhedron and interes...

Dear developers, I am interested in vertex enumeration for a system of equations and inequalities. My question is does the CDD algorithm implemented in polymake computes a certain (insertion) ordering for the input ? or it is sensitive to the ordering of the rows of equations/inequalities in the inp...

Thank you very much !

Hello, I made a newton polytope from the polynomial equation given below: $d = $e*$x5+$e*$x12*$x4; $nd = newton($d); then when I print the faces lattice structure it turns out to be: print $HD->FACES; {} {0} {1} {0 1} but when I try to access the last 1 dimensional face i.e. for (my $k=$HD->DIMS->[1...