Chapter 8 "Network optimization models", after completing this chapter, you should be able to: State why network models are important tools for problem solving, describe the kinds of problems that can be solved using the shortest-route algorithm and use the algorithm to solve typical shortest-route problems, formulate the shortest-route problem as a linear programming problem,. | Chapter 8 Network Optimization Models Part 2 Deterministic Decision Models Learning Objectives State why network models are important tools for problem solving. Describe the kinds of problems that can be solved using the shortest-route algorithm and use the algorithm to solve typical shortest-route problems. Formulate the shortest-route problem as a linear programming problem. Solve the shortest-route problem using Excel. After completing this chapter, you should be able to: McGraw-Hill/Irwin 8– Learning Objectives (cont’d) Describe the kinds of problems that can be solved using the minimal-spanning-tree algorithm and use the algorithm to solve typical minimal-spanning-tree problems. Describe the kinds of problems that can be solved using the maximal-flow algorithm and use the algorithm to solve typical maximal-flow problems. Formulate the maximal-flow problem as a linear programming problem. Solve the maximal-flow problem using Excel. After completing this chapter, you should be able to: McGraw-Hill/Irwin 8– Networks Network A set of nodes and connecting arcs or branches. Can be useful in representing various systems, such as distribution systems, production systems, and transportation systems. Network models are an important approach for problem solving because: They can be used to model a wide range of problems. They are relatively simple to work with They provide a visual portrayal of a problem. McGraw-Hill/Irwin 8– Frequently Used Algorithms Shortest-Route Algorithm Used for determining the shortest time, distance, or cost from an origin to a destination through a network. Minimum Spanning Tree Algorithm Used in determining the minimum distance (cost, time) needed to connect a set of locations into a single system. Maximal Flow Algorithm Used for determining the greatest amount of flow that can be transmitted through a system in which various branches, or connections, have specified flow capacity limitations. McGraw-Hill/Irwin 8– Figure 8–1 A . | Chapter 8 Network Optimization Models Part 2 Deterministic Decision Models Learning Objectives State why network models are important tools for problem solving. Describe the kinds of problems that can be solved using the shortest-route algorithm and use the algorithm to solve typical shortest-route problems. Formulate the shortest-route problem as a linear programming problem. Solve the shortest-route problem using Excel. After completing this chapter, you should be able to: McGraw-Hill/Irwin 8– Learning Objectives (cont’d) Describe the kinds of problems that can be solved using the minimal-spanning-tree algorithm and use the algorithm to solve typical minimal-spanning-tree problems. Describe the kinds of problems that can be solved using the maximal-flow algorithm and use the algorithm to solve typical maximal-flow problems. Formulate the maximal-flow problem as a linear programming problem. Solve the maximal-flow problem using Excel. After completing this chapter, you should be
