Dear Prof.

Many thanks for the informative details.

Best regards
Abbas

Dear Prof. Joswig, Following up on the link you provided in the tutorial, I am trying to separate the CG-cuts on a specific polyhedron. It seems to work well and cuts the floating points from the problem space. (All vertices would be lattice points). Would you please, are there any related documents...

Dear Prof. Joswig,

Many thanks for the explanation. This is exactly what I was looking for.

Best regards
Abbas

Dear support team, I hope you are doing well. I am working on a simple polyhedron to separate a specific cut. The polyhedron defines as P = {4x1+x2<=28, x1+4x2<=27, x1-x2<=1, x1>=0, x2>=0}. I computed the vertex and lattice points of the polyhedron by: $p = new Polytope(INEQUALITIES=>[[28,-4,-1],[27...

Dear Dr. Paffenholz, Many thanks for your comments. Actually, I mean by extreme points is integer vertices (integer convex hull) and the provided output of the function is what exactly I was looking for. But the thing that was strange is, I could not get the results from the mentioned function last ...

Dear Dr. Paffenholz, Many thanks for your prompt reply. I am aware of, the finding all of the integer vertices of a MILP problem needs to consume a lot of time and effort, but for a trivial problem, it is very helpful for understanding the problem structure. W.r.t the above problem, As it has four v...

Dear support team, I am trying to implement a decomposition algorithm and I have to work with extreme points of the MILP. As I asked some questions about defining polyhedron, I have tried to use the same approach to find integer vertices, but I am failing to do that. Also, I am working on lattice an...

Dear Thomas, Many thanks for your clarifying where I was doing wrong. It now makes sense as the two different methods (matrix & in/eq form) could produce the same solution. Would you say places, where I can find the related documents about what Dr. Joswig mentioned for the polyhedron specificati...

Dear Prof. Joswig, Many thanks for your detailed explanation. As I am pretty new in this field, what you answered is very interesting to me. Would you say please, how we can find the related documents about the interpretation of the vertices method? I mean, how can I find the number of vertices, ray...

Dear support team, Thanks for your helpful answer. I have tried this and works well, but I have an issue with calculating the vertices by defining the polyhedron based on both methods. Let's say, in the first attempt, I define the problem by the following method: // $p = new Polytope(INEQUALITIES=>[...