{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Chapter 7 - ManagementScience ManagementScience BIT2406...

This preview shows pages 1–7. Sign up to view the full content.

Management Science Management Science BIT 2406 BIT 2406 Chapter 7 Chapter 7 Network Flow Models Network Flow Models 1 BIT 2406

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

View Full Document
Reading Questions Reading Questions What is a network? Be able to give some examples of networks. Why are networks popular? What are nodes and branches? What is the shortest route problem? What are the steps of the shortest route solution method? Be able to explain each step. What is the minimal spanning tree problem? Be able to compare and contrast minimal spanning tree and shortest route. What are the steps of the minimal spanning tree solution method? Be able to explain each step. What did E.W. Dijkstra do? What is the maximal flow problem? How is the maximal flow problem different from the shortest route problem and the minimal spanning tree problem? What is the difference between directed branches and undirected branches? What are the steps of the maximal flow solution method? Be able to explain each step. BIT 2406 2
Chapter Topics Chapter Topics Shortest Route Problem: direction between  destination and source Minimal Spanning Tree Problem:  no  direction, only care about length of  connection Maximal Flow Problem: maximization BIT 2406 3

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

View Full Document
Networks Networks Nodes and branches A network is an arrangement of paths connected at various  points, through which one or more items move from one point  to another . For example, highway systems, telephone networks, railroad  systems, and television networks. Networks are popular because they provide a picture of a system. Enables a manager to visually interpret the system and thus enhances  the manager’s understanding. Networks are also popular because a large number of systems can be  easily modeled as networks. BIT 2406 4
Networks Networks Network flow models: describe the flow of items  through a system. We will discuss the use of network flow models to  analyze three types of problems: Shortest route problem Minimal spanning tree problem Maximal flow problem BIT 2406 5

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

View Full Document
Networks Networks Networks are illustrated as diagrams consisting of two main  components: nodes and branches. Nodes,  denoted by circles, represent junction points connecting  branches; usually cities or terminals Nodes typically represent localities, such as cities, intersections, or air or  railroad terminals. Branches,  represented as lines, connect nodes and show flow  from one point to another; usually roads or railroad/air routes Branches are the paths connecting the nodes such as roads connecting cities  and intersections or air routes connecting terminals.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 35

Chapter 7 - ManagementScience ManagementScience BIT2406...

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

View Full Document
Ask a homework question - tutors are online