net3node - p minimize Total_Cost; m node Plant: net_out =...

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

View Full Document Right Arrow Icon
set D_CITY; set W_CITY; set DW_LINKS within (D_CITY cross W_CITY); s param p_supply >= 0; # amount available at plant param w_demand {W_CITY} >= 0; # amounts required at warehouses p check: p_supply = sum {j in W_CITY} w_demand[j]; param pd_cost {D_CITY} >= 0; # shipment costs/1000 packages param dw_cost {DW_LINKS} >= 0; p param pd_cap {D_CITY} >= 0; # max packages that can be shipped param dw_cap {DW_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: p minimize Total_Cost; m node Plant: net_out = p_supply; n node Dist {i in D_CITY}; n node Whse {j in W_CITY}: net_in = w_demand[j]; n arc PD_Ship {i in D_CITY} >= 0, <= pd_cap[i], from Plant, to Dist[i], obj Total_Cost pd_cost[i]; arc DW_Ship {(i,j) in DW_LINKS} >= 0, <= dw_cap[i,j], from Dist[i], to Whse[j], obj Total_Cost dw_cost[i,j];...
View Full Document

Ask a homework question - tutors are online