[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] Transport Problem advanced
From: |
Andrew Makhorin |
Subject: |
Re: [Help-glpk] Transport Problem advanced |
Date: |
Thu, 9 Oct 2008 13:23:02 +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?
No, it is mip due to disjunctive constraint.
See example model ftcp.mod, included in the glpk distribution.
- [Help-glpk] Transport Problem advanced, SpaceRider, 2008/10/08
- Re: [Help-glpk] Transport Problem advanced,
Andrew Makhorin <=
- 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