Line: 1 to 1 | ||||||||
---|---|---|---|---|---|---|---|---|
The Transportation Problem in AMPLAMPL Formulation | ||||||||
Changed: | ||||||||
< < | The formulation of the transportation problem is AMPL is a straightforward translation of the mathematical programme for the transportation problem. | |||||||
> > | The formulation of the transportation problem is AMPL is a straightforward translation of the mathematical programme for the transportation problem. We will build the file transportation.mod. | |||||||
The sets ![]() ![]() SUPPLY_NODES and DEMAND_NODES respectively:
| ||||||||
Line: 55 to 55 | ||||||||
Balancing Transportation Problems | ||||||||
Changed: | ||||||||
< < | Balanced transportation models are preferred as there is no confusion about the relational operators for the supply and demand constraints. We can use script file to balance any transportation problem automatically: | |||||||
> > | Balanced transportation models are preferred as there is no confusion about the relational operators for the supply and demand constraints. We can use a script file (transportation.run) to balance any transportation problem automatically: | |||||||
reset; | ||||||||
Line: 96 to 96 | ||||||||
Note the check statement to ensure that the balancing has been done properly before solving. Also, note that costToDummy and costFromDummy allow for the definition of costs on any flow from/to a dummy node in the data file. | ||||||||
Deleted: | ||||||||
< < | Both the AMPL model file transportation.mod and script file transportation.run are attached. | |||||||
-- MichaelOSullivan - 02 Apr 2008
|