[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Help-glpk] Transport Problem advanced
From: |
SpaceRider |
Subject: |
[Help-glpk] Transport Problem advanced |
Date: |
Thu, 9 Oct 2008 01:19:09 +0400 |
// 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?
Can someone help me?
Thank you
--
View this message in context:
http://www.nabble.com/Transport-Problem-advanced-tp19886757p19886757.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.
- [Help-glpk] Transport Problem advanced,
SpaceRider <=
- Re: [Help-glpk] Transport Problem advanced, Bruno Rosell i Gui, 2008/10/09
- Re: [Help-glpk] Transport Problem advanced, SpaceRider, 2008/10/09
- Re: [Help-glpk] Transport Problem advanced, SpaceRider, 2008/10/10
- Re: [Help-glpk] Transport Problem advanced, SpaceRider, 2008/10/13
- Re: [Help-glpk] Transport Problem advanced, SpaceRider, 2008/10/14
- Re: [Help-glpk] Transport Problem advanced, SpaceRider, 2008/10/19