On Tue, 21 Jul 2020, Domingo Alvarez Duarte wrote:
Do you have any example doing what you are talking about ?
In theory it should work.
Right now it process all models in the "examples" folder and the output is
identical to the original GLPK/GMPL except that uses less memory and is
slightly faster.
Things like the GMPL equivalent of { (a,b,c) in A x B x C : b=a+1, c=b+2 }
My understanding is that the current GMPL processor will form A x B x C
before applying the filtering.
If A, B and C have 100 items each, the inefficiency can probably be lived with.
If they have 1,000 items each, it will be grindly slow, assuming it finishes.
If they have 10,000 items each,
the set will be to big for the handler to store.
Of course, done right, a set of 10,000 3-tuples should not be a problem.
On 21/7/20 15:24, Michael Hennebry wrote:
Are these changes supposed to deal with things like nested set iterations?
--
Michael henne...@web.cs.ndsu.nodak.edu
"Sorry but your password must contain an uppercase letter, a number,
a haiku, a gang sign, a heiroglyph, and the blood of a virgin."
-- someeecards
