Chapter 7. Network Flow Models
| A network is an arrangement of paths connected at various points, through which one or more items move from one point to another. Everyone is familiar with such networks as highway systems, telephone networks, railroad systems, and television networks. For example, a railroad network consists of a number of fixed rail routes (paths) connected by terminals at various junctions of the rail routes. A network is an arrangement of paths connected at various points, through which items move . In recent years using network models has become a very popular management science technique for a couple of very important reasons. First, a network is drawn as a diagram, which literally provides a picture of the system under analysis. This enables a manager to visually interpret the system and thus enhances the manager's understanding. Second, a large number of real-life systems can be modeled as networks, which are relatively easy to conceive and construct. Networks are popular because they provide a picture of a system and because a large number of systems can be easily modeled as networks . In this and the next chapter we will look at several different types of network models. In this chapter we will present a class of network models directed at the flow of items through a system. As such, these models are referred to as network flow models . We will discuss the use of network flow models to analyze three types of problems: the shortest route problem, the minimal spanning tree problem, and the maximal flow problem. In Chapter 8 we will present the network techniques PERT and CPM, which are used extensively for project analysis. |
EAN: 2147483647
Pages: 358