[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

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

From: Andrew Makhorin
Subject: Re: [Help-glpk] Building set of sets from plain set - efficient implementation
Date: Sat, 13 Dec 2008 11:36:23 +0300

Hi Xypron,

> The syntax should be able to handle sets with multiple indexes like
> set C in the example below.

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. 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.

(I plan to make a new release in the new year. However, if you are
interested in allocating a pre-release on your web site for testing
purposes, I could post you the distribution tarball.)


Andrew Makhorin

reply via email to

[Prev in Thread] Current Thread [Next in Thread]