303. Network Flow

Types of Problems:





Node 𝑖







Units shipped from node 𝑖 to node 𝑗:

𝑥𝑖𝑗

Minimize:

𝑍=𝑖,𝑗𝑐𝑖𝑗𝑥𝑖𝑗

s.t.

𝑘𝑥𝑘𝑖𝑙𝑥𝑖𝑙=oror𝑏1𝑙𝑖𝑗𝑥𝑖𝑗𝑢𝑖𝑗

Where:



If:


Important:

Example




Minimize

𝑍=30𝑥12+40𝑥14+50𝑥23+35𝑥35+40𝑥53+30𝑥54+35𝑥56+25𝑥65+50𝑥74+45𝑥75+50𝑥76


s.t.

𝑥12+𝑥14200(Node 1)

𝑥12+𝑥23100(Node 2)

𝑥23+𝑥53𝑥3560(Node 3)

𝑥14+𝑥54+𝑥7480(Node 4)

𝑥35+𝑥65+𝑥75𝑥53𝑥54𝑥56170(Node 5)

𝑥56+𝑥76𝑥6570(Node 6)

𝑥76+𝑥75+𝑥74300(Node 7)


𝑥𝑖𝑗0 (𝑖,𝑗)𝐸



Example





Minimize:

𝑖𝑗(𝑐𝑖𝑗𝑓𝑦𝑖𝑗)+𝑖𝑗(𝑐𝑖𝑗𝑣𝑥𝑖𝑗)+𝑖(𝑐𝑖𝑓𝑦𝑖)+𝑖(𝑝𝑖𝑠𝑖)+


Where:

  • 𝑖𝑗(𝑐𝑖𝑗𝑓𝑦𝑖𝑗): Edge fixed cost contribution

  • 𝑖𝑗(𝑐𝑖𝑗𝑣𝑥𝑖𝑗): Variable cost contribution

  • 𝑖(𝑐𝑖𝑓𝑦𝑖): Node fixed cost contribution

  • 𝑖(𝑝𝑖𝑠𝑖): Penalty contribution

  • 𝑖𝑗(𝑙𝑖𝑗𝑥𝑖𝑗): Edge lead time weighted by flow

  • 𝑖𝑙𝑖𝑗𝑥𝑖𝑗: Node service time weighted by flow


s.t.

𝑗𝑥𝑗𝑖𝑗𝑥𝑖𝑗=oror𝑑𝑖Flow Conservation

𝑏𝑖𝑗𝑙𝑥𝑖𝑗𝑏𝑖𝑗𝑢Lower & Upper Flow Bound

𝑥𝑖𝑗𝑀𝑦𝑖𝑗Fixed Cost Route

𝑖(𝑥𝑗𝑖+𝑥𝑖𝑗)𝑀𝑦𝑖Fixed Cost Node

𝑖𝑥𝑖𝑗+𝑠𝑗𝑑𝑗Unmet Demand Penalty

𝑥𝑖𝑗0 (𝑖,𝑗)𝐸Non Negative Flow





Node Properties:

Edge Properties: