mcf1 - 1 Minimum Cost Flows 2 The Minimum Cost Flow Problem...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Minimum Cost Flows 2 The Minimum Cost Flow Problem u ij = capacity of arc (i,j). c ij = unit cost of shipping flow from node i to node j on (i,j). x ij = amount shipped on arc (i,j) Minimize ∑ (i,j) ∈ A c ij x ij ∑ j x ij- ∑ k x ki = b i for all i ∈ N . and 0 ≤ x ij ≤ u ij for all (i,j) ∈ A. 3 Find the shortest path from node 1 to node 6 1 2 3 4 5 6 2 4 2 1 3 4 2 3 2 b(1) = 1 b(6) = -1 The optimal flow is to send one unit of flow along 1-2-5-6. This transformation works so long as there are no negative cost cycles in G. (What if there are negative cost cycles?) 4 Find the Maximum Flow from s to t s 1 2 t 10 , 8 8, 7 1, 1 10, 6 6, 5 b(i) = 0 for all i; add arc (t,s) with a cost of -1 and large capacity. The cost of every other arc is 0. 13 The optimal solution in the corresponding minimum cost flow problem will send as much flow in (t,s) as possible. 5 Transshipment Problems Plants with given production capabilities for a product. One can ship directly from the plants to retailers, or from plants to warehouses, and then from warehouses to retailers. There is a given demand for each retailer. Costs of shipment are given. What is the minimum cost method for satisfying demands? 6 A Network Representation Plants Warehouses Retailers 1 2 3 4 5 6 7 190 310 100 400 180 Demands 1 2 3 4 5 6 7 400 1 2 3 4 5 6 7 400 1 2 3 4 5 6 7 7 The Caterer Problem Demand for d i napkins on day i for i = 1 to 7 (so, j ∈ [1..7]). Cost of new napkins: a cents each, 2-day laundry: b cents per napkin 1-day laundry: c cents per napkin. Minimize the cost of meeting demand. 1 2 3 4 5 6 7 2’ 3’ 4’ 5’ 6’ 7’ clean dirty demand arcs a c b 1’ 8 Purchase arcs In any period of the seven periods, one can purchase napkins, at a cost of a cents per napkin. 1 2 3 4 5 6 7 a clean napkins 9 Demand Arcs You must use d i napkins on day i 1 2 3 4 5 6 7 lower bound on flows a dirty napkins 1’ d 1 2’ d 2 3’ d 3 4’ 5’ 6’ d 4 d 5 d 6 7’ d 7 10 The rest of the arcs You may launder napkins in 2 days at b cents each 1 2 3 4 5 6 7 a 1’ 2’ 3’ 4’ 5’ 6’ 7’ b You may launder napkins in 1 day at c cents each c You may store clean napkins for free You may store dirty napkins for free Application to airplane maintenance. 11 Some Assumptions 1. All data is integral. All data is integral....
View Full Document

This note was uploaded on 01/26/2011 for the course IEOR 4004 taught by Professor Sethuraman during the Fall '10 term at Columbia.

Page1 / 32

mcf1 - 1 Minimum Cost Flows 2 The Minimum Cost Flow Problem...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online