Re: [Help-glpk] Transport Problem advanced

[Andrew Makhorin]

> // s.t. supply{i in I}: sum{j in J} x[i,j] = a[i];
> s.t. supply{i in I}: sum{j in J} x[i,j] = a[i]; // process all offer

> s.t. demand{j in J}: sum{i in I} x[i,j] >= b[j];

> Now, I need a additional comparison, but not a range from to
> sum{i in I} x[i,j] >= b[j] OR sum{i in I} x[i,j] = 0

> How I have to write the syntax?
> Is it still a LP-Problem?

No, it is mip due to disjunctive constraint.

See example model ftcp.mod, included in the glpk distribution.