Re: [Help-glpk] Linear expressions in the integrands of iteratedexpressions

[Barry Rountree]

On Sunday 22 October 2006 22:23, Tor Myklebust wrote:
> > That's a very good suggestion, but it doesn't quite handle
> > what I'm trying to do.  I'm trying to code up
> > exclusivity without having to use "binary", e.g.
> >
> >    s.t. foo:sum{i in I} x[i] = 42;
> >    s.t. bar:max{i in I} x[i] = 42;
> 
> The set of x that satisfy both constraints is not a convex set, so you are 
> unlikely to have much luck representing these constraints in a linear 
> program.  (It is, in fact, a finite set if each x[i] is constrained to be 
> nonnegative.)

Ah, didn't know that.  Easy enough to get around, though, yes?

    s.t. foo:sum{i in I} x[i] = 42 + slop;
    s.t. bar:max{i in I} x[i] = 42 - slop;

Barry