Re: [Help-glpk] Transport Problem advanced

[SpaceRider]

Great, thank you (both) for the hints

I think I recognise. I must try, now.


Andrew Makhorin wrote:
> 
>> // 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.
> 
> 
> 
> _______________________________________________
> Help-glpk mailing list
> address@hidden
> http://lists.gnu.org/mailman/listinfo/help-glpk
> 
> 

-- 
View this message in context: 
http://www.nabble.com/Transport-Problem-advanced-tp19887773p19898314.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.