Hello, I installed g++, now the commands work fine but still some issues: print $f->COORDINATE_LABELS; a1 a10 a11 a12 a13 a14 a15 a16 a17 a18 a2 a3 a4 a5 a6 a7 a8 a9 As the inhomog_var is not included in the labels. So, I modified the subsequent steps e.g. @vars = (map {"a".$_} (1..18)); $...

Hi,

Thanks for this new function. I am still interested to change the coordinate labels. This will ensure consistency because I read many polytopes and then check for equality and containment

Regards,
Satya

Hi Benjamin, The line: $perm = find_permutation($f->COORDINATE_LABELS,[@vars]); gives the following error: polymake: ERROR: Shared module compilation failed; see the error log below make: g++: Command not found make: *** [/tmp/poly23874Taaaa0013.o] Error 127 I am using polymake version 2.12, release...

Hello, I tried using contains on a specific example. I read the lp file using lp2poly: $f = convert_to<Rational>lp2poly('demo1.lp'); (below is the lp file, sorry could not attach it) Maximize Subject To c0: - a1 + a2 - a11 = 2 cc2l0: - a1 + a2 <= 1 c1: a2 - a6 = 1 cc2l1: - a1 + a2 <= 1 c2: a3 + a5 -...

Hi, to be sure, Does the contains function also takes into account the AFFINE_HULL property ?

Hi Benjamin, Thank you !

Dear all, I am solving the following problem: Input: Polytope P given in V-description, polytope Q given in V-description (P & Q may not be bounded) Output: “Yes” if P ⊆ Q, “No” otherwise I thought of enumerating the FACETS of P and checking whether each vertex of Q satisfies the constraints fro...

Thank you I was reading the lp file in float but now after changing it to Rational, I also get a single vertex

Can we try with a small example ? Suppose I have a set of inequalities in lp format e.g. Maximize Subject To c0: - a1 - a2 + a3 = 0 cc2l0: - a1 + a3 <= -2 c1: a2 = -2 cc2l1: a1 + a2 - a3 <= 1 cc3l1: a1 <= -1 c2: - a2 + a3 = -1 cc1l2: - a1 - a2 + a3 <= 0 Bounds a1 free a2 free a3 free End The set of ...

Thank you very much ! Is there such a function if the polytope is unbounded ? (i.e. to sample 'n' points)