January 2017
Beginner to intermediate
280 pages
217h 11m
English
The transportation algorithm is an iterative procedure in which an initial solution to a transportation problem is found. This solution is evaluated using a special procedure to determine if it is optimal. If the solution is optimal, the process stops. If it is not optimal, a new solution is generated. This new solution is at least as good as the previous one, and it is usually better. This new solution is then evaluated, and if it is not optimal, another solution is generated. The process continues until the optimal solution is found.
We will illustrate this method using the Executive Furniture Corporation example that was first seen in Chapter 9. The company manufactures office desks at three locations: Des ...