Re: [Help-glpk] Building set of sets from plain set - efficient implementation

[Andrew Makhorin]

> The plain set may have arbitrary dimension, i.e. arbitrary number
> of indices are allowed. It is only required that the dimension of the
> set to be defined (i.e. the number of its subscripts) plus its arity
> must be equal to the arity of the plain set specified.

Incorrect ("arity" just means the number of subscripts). Must read:

... the arity of the set to be defined (i.e. the number of its
subscripts) plus the dimension of plain sets assigned to its members
must be equal to the dimension of the plain set specified in the
set statement ...

> Integers
> within parentheses is a permutation of 1, 2, ..., n, where n is the
> arity of the plain set. This permutation specifies which components
> of every tuple from the plain set become member indices, and which
> ones become components of new tuples.