1. Welcome to MM305 Unit 6 Seminar Dr. Bob Network Models

2. Network Models 1.Minimal-Spanning Tree Technique [least amount of material to connect all points] 2.Maximal-Flow Technique [maximum amount of material that can flow through a network] 3.Shortest-Route Technique [travel from one location to another while minimizing total distance]

3. Minimal-Spanning Tree Technique The minimal-spanning tree technique involves connecting all the points of a network together while minimizing the distance between them. See Problem 6-12 (page 222)

4. Minimal-Spanning Tree Technique QM for Windows Problem 6-12 Distance

5. Minimal Spanning Tree Solution Total Distance

6. Maximal-Flow Technique The maximal-flow technique allows us to determine the maximum amount of a material that can flow through a network See Solved Problem 6-2 (page 218)

7. Maximal-Flow Technique QM for Windows Arcs Outbound

8. Maximal-Flow Technique Total Flow

9. Shortest-Route Technique The shortest-route technique finds how a person or item can travel from one location to another while minimizing the total distance traveled It finds the shortest route to a series of destinations See Problem 6-9 (page 221)

10. Shortest-Route Technique

11. Shortest Route Total Distance

12. Questions? You can use Excel QM for Shortest-Path and Maximal Flow but NOT Minimal-Spanning Tree Technique. To solve Minimal- Spanning Tree problems you must use QM for Windows or do them by hand.