Quantitative Analysis for Management, 13/e

Module 8 Transportation, Assignment, and Network Algorithms

Learning Objectives

After completing this module, students will be able to:

1. M8.1 Use the northwest corner and stepping-stone methods to solve transportation problems.

2. M8.2 Use the Hungarian (matrix reduction) method to solve assignment problems.

3. M8.3 Use the maximal flow algorithm.

4. M8.4 Use the shortest-route method.

In Chapter 9, several important distribution and network models were presented. Linear programming was used extensively in the presentation of these models. However, there are some specialized algorithms that can be used to find the best solutions more quickly and are often used instead of linear programming. In this module, we will present these specialized techniques ...