Line: 1 to 1 | ||||||||
---|---|---|---|---|---|---|---|---|
The Transshipment Problem in AMPL | ||||||||
Line: 28 to 28 | ||||||||
param Supply {SUPPLY_NODES} >= 0, integer; param Demand {DEMAND_NODES} >= 0, integer; | ||||||||
Changed: | ||||||||
< < | param NetDemand {n in NODES} integer, default 0 | |||||||
> > | param NetDemand {n in NODES} integer | |||||||
:= if n in SUPPLY_NODES then -Supply[n] else if n in DEMAND_NODES then Demand[n]; # else 0 by default | ||||||||
Added: | ||||||||
> > | Note that no default value is needed for NetDemand as it is explicitly defined for all nodes. | |||||||
The set ARCS is defined between pairs of nodes and costs and bounds are also defined:
| ||||||||
Line: 54 to 55 | ||||||||
sum {(i, j) in ARCS} Flow[i, j] - sum {(j, k) in ARCS} Flow[j, k] >= NetDemand[j]; | ||||||||
Changed: | ||||||||
< < | -- TWikiAdminGroup - 22 Apr 2008 | |||||||
> > | -- MichaelOSullivan - 06 Oct 2014 | |||||||
|