Ch 9 Network Opt Models

Ch 9 Network Opt Models - 4 T-14 B E 4 5 C E 3 4 D T 8 9 E...

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

View Full Document Right Arrow Icon
Ch. 9 - Network Optimization Models Contents: Seervada Park Shortest-Path Problem Seervada Park Maximum Flow Problem Distribution Unlimited Co. Minimum Cost Flow Problem Click on the tab below to select the worksheet of your choice.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Seervada Park Shortest-Path Problem From To On Route Distance Nodes Net Flow Supply/Demand O A 1 2 O 1 = 1 O B 0 5 A 0 = 0 O C 0 4 B 0 = 0 A B 1 2 C 0 = 0 A D 0 7 D 0 = 0 B C 0 1 E 0 = 0 B D 0 4 T -1 = -1 B E 1 3 C B 0 1 C E 0 4 D E 0 1 D T 1 5 E D 1 1 E T 0 7 Total Distance = 13
Background image of page 2
Seervada Park Maximum Flow Problem From To Flow Capacity Nodes Net Flow Supply/Demand O A 4 5 O 14 O B 7 7 A 0 = 0 O C 3 4 B 0 = 0 A B 1 1 C 0 = 0 A D 3 3 D 0 = 0 B C 0 2 E 0 = 0 B D 4
Background image of page 3

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

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

Unformatted text preview: 4 T-14 B E 4 5 C E 3 4 D T 8 9 E D 1 1 E T 6 6 Maximum Flow = 14 Distribution Unlimited Co. Minimum Cost Flow Problem From To Ship Capacity Unit Cost Nodes Net Flow Supply/Demand A B <= 10 2 A 50 = 50 A C 40 4 B 40 = 40 A D 10 9 C = B C 40 3 D-30 =-30 C E 80 <= 80 1 E-60 =-60 D E 3 E D 20 2 Total Cost = 490...
View Full Document

Page1 / 4

Ch 9 Network Opt Models - 4 T-14 B E 4 5 C E 3 4 D T 8 9 E...

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

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