Welcome to MM305

Unit 6 Seminar

Dr. Bob

Network Models

Network Models1. 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]

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)

Minimal-Spanning Tree TechniqueQM for Windows

Problem 6-12

Distance

Minimal Spanning Tree Solution

Total Distance

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)

Maximal-Flow TechniqueQM for Windows

ArcsOutbound

Maximal-Flow Technique

Total Flow

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)

Shortest-Route Technique

Shortest-Route TechniqueShortest Route

Total Distance

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.