1 / 20

ENGM 732 Network Flow Programming

ENGM 732 Network Flow Programming. Network Flow Models. Transportation Models. (Flow, Cost) [External Flow]. [-3]. (3,3). [4]. 4. 1. (1,1). (0,4). (2,2). [-3]. 2. 5. [2]. (0,4). (0,3). (3,3). [-3]. 3. 6. [3]. Transportation Models. (Flow, Cost) [External Flow]. [-3].

alaura
Download Presentation

ENGM 732 Network Flow Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ENGM 732Network Flow Programming Network Flow Models

  2. Transportation Models (Flow, Cost) [External Flow] [-3] (3,3) [4] 4 1 (1,1) (0,4) (2,2) [-3] 2 5 [2] (0,4) (0,3) (3,3) [-3] 3 6 [3]

  3. Transportation Models (Flow, Cost) [External Flow] [-3] (3,3) [4] 4 1 (1,1) Properties All arcs have infinite capacity. All nodes have nonzero fixed external flows. The sum of the external flows over all nodes is zero. (0,4) (2,2) [-3] 2 5 [2] (0,4) (0,3) (3,3) [-3] 3 6 [3]

  4. Assignment Models (Flow, Cost) [External Flow] [-1] (0,4) [1] 4 1 (1,1) (1,3) (0,8) [-1] 2 5 [1] (0,4) (0,2) (1,2) [-1] 3 6 [1]

  5. Assignment Models (Flow, Cost) [External Flow] [-1] (0,4) Assignment All demands and supplies are unity. Find the one-to-one pairing of the two sets that minimizes the sum of the pairing costs. [1] 4 1 (1,1) (1,3) (0,8) [-1] 2 5 [1] (0,4) (0,2) (1,2) [-1] 3 6 [1]

  6. Shortest Path (Flow, Cost) [External Flow] 2 (0,4) (0,5) (0,3) (1,2) (0,6) [-1] 1 5 [1] 3 (1,1) (1,4) (0,5) 4

  7. Shortest Path Shortest Path One node is the source. One node is the sink. Optimal path is the sequence of arcs such that the sum of the arc costs on the path are minimized. (Flow, Cost) [External Flow] 2 (0,4) (0,5) (0,3) (1,2) (0,6) [-1] 1 5 [1] 3 (1,1) (1,4) (0,5) 4

  8. Maximum Flow Models (Flow, Capacity) (4,4) 2 4 (6,8) (4,10) (2,2) (0,3) (0,8) 6 1 (5,7) (3,6) (3,3) 5 3

  9. Maximum Flow Models (Flow, Capacity) Maximal Flow Capacity is only relevant parameter. Find maximal flow from source to sink. (4,4) 2 4 (6,8) (4,10) (2,2) (0,3) (0,8) 6 1 (5,7) (3,6) (3,3) 5 3

  10. Maximum Flow Models (Flow, Capacity) Maximal Flow Capacity is only relevant parameter. Find maximal flow from source to sink. (4,4) 2 4 (6,8) (4,10) (2,2) (0,3) (0,8) 6 1 (5,7) (3,6) (3,3) 5 3

  11. Maximum Flow Models (Flow, Capacity) [External Flow] Maximal Flow Capacity is only relevant parameter. Find maximal flow from source to sink. (4,4) 2 4 (6,8) (4,10) [-M] [M] (2,2) (0,3) (0,8) 6 S S 1 (5,7) (3,6) (3,3) 5 3

  12. Network with Gains (Flow, capacity, gain, cost) [External Flow] 2 (1,2,.5,3) (1.5,4,2,1) [3] [-3] 1 4 (1,2,1,-1) (0,2,1,1) (2,2,.5,2) (0,4,2,5) 3

  13. Relationships Assignment Transpor- tation General Min Cost Flow Linear Program Shortest Path Pure Min Cost Flow Maximal Flow Less General More General

  14. Network with Slack External Flow [External Flow, max slack external flow, slack cost] [-1,2,-2] 2 [2,2,1] [-1] 1 4 3 [0,-2,1]

  15. Pure Min Cost Flow Consider K-Chair Corp. Plant Cost / Chair Max Production Min Production 1 $5 500 0 2 7 750 400 3 3 1000 500 4 4 250 250 Wood comes from 1 of 2 suppliers and K-Chair agrees to buy 8 tons (800 chairs at 20 lbs / chair) from each supplier. Cost is $0.10 per lbs from supplier one and $0.075 per lbs from supplier 2. Transportation costs follow. P1 P2 P3 P4 Supplier 1 0.01 0.02 0.04 0.04 Supplier 2 0.04 0.03 0.02 0.02

  16. Pure Min Cost Flow Chairs are sold in NY, Houston, San Francisco, and Chicago. Transportation costs From each plant to each city follows NY H SF C P1 1 1 2 0 P2 3 6 7 3 P3 3 1 5 3 P4 8 2 1 4 Selling price, maximum demand, and minimum demand follow SP Max Min NY $20 2000 500 H 15 400 100 SF 20 1500 500 C 18 1500 500

  17. K-Chair (Supplier) (lower, upper, cost) [Fixed, slack, cost] (0,M,.2) [800,M,2] 1 3 5 2 4 6 [800,M,1.5]

  18. K-Chair (Production) (lower, upper, cost) [Fixed, slack, cost] (0,M,.2) [800,M,2] (400,750,7) 1 3 5 7 9 2 4 6 8 10 [800,M,1.5]

  19. K-Chair (Shipping) (0,M,1) (lower, upper, cost) [Fixed, slack, cost] (0,M,1) (0,M,.2) [800,M,2] (400,750,7) (0,M,2) 1 3 5 7 9 NY SF (0,M,0) 8 6 10 4 H C 2 [800,M,1.5]

  20. K-Chair (Sales) (0,M,1) (lower, upper, cost) [Fixed, slack, cost] (0,500,5) [-500,-1500,-20] (0,M,1) (0,M,.2) [800,M,2] (400,750,7) (0,M,2) [-100,-300,-15] 3 SF 9 NY 7 5 1 (0,M,0) (500,1000,3) 6 2 C H 10 8 4 [-500,-1000,-20] [800,M,1.5] (250,250,4) [-500,-1000,-18]

More Related