netthru - # max shipment over links p minimize Total_Cost;...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
set CITIES; set LINKS within (CITIES cross CITIES); s param supply {CITIES} >= 0; # amounts available at cities param demand {CITIES} >= 0; # amounts required at cities p check: sum {i in CITIES} supply[i] = sum {j in CITIES} demand[j]; param cost {LINKS} >= 0; # shipment costs per ton p param city_cap {CITIES} >= 0; # max throughput at cities param link_cap {LINKS} >= 0;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: # max shipment over links p minimize Total_Cost; m node Supply {k in CITIES}: net_out = supply[k]; node Demand {k in CITIES}: net_in = demand[k]; n arc Ship {(i,j) in LINKS} >= 0, <= link_cap[i,j], from Demand[i], to Supply[j], obj Total_Cost cost[i,j]; arc Through {k in CITIES} >= 0, <= city_cap[k], from Supply[k], to Demand[k];...
View Full Document

This note was uploaded on 04/01/2011 for the course CO 370 taught by Professor Henry during the Winter '11 term at Waterloo.

Ask a homework question - tutors are online