Page 299 -

Chapter 7

Transportation, Assignment

and Transshipment Problems

7.1 Transportation Problem: A Network Model 7.4 Assignment Problem: A Special-Purpose
and a Linear Programming Formulation Solution Procedure
Problem Variations Finding the Minimum Number of Lines
A General Linear Programming Model of the Problem Variations
Transportation Problem
7.5 Transshipment Problem: The Network Model
7.2 Transportation Simplex Method: A Special- and a Linear Programming Formulation
Purpose Solution Procedure Problem Variations
Phase I: Finding an Initial Feasible Solution A General Linear Programming Model of the
Phase II: Iterating to the Optimal Solution Transshipment Problem
Summary of the Transportation Simplex Method
7.6 A Production and Inventory Application
Problem Variations
7.3 Assignment Problem: The Network Model
and a Linear Programming Formulation
Problem Variations
A General Linear Programming Model of the
Assignment Problem
Multiple Assignments

Learning Objectives By the end of this chapter you will be able to:

l Formulate and solve transportation problems
l Formulate and solve assignment problems

l Formulate and solve transhipment problems
l Interpret and explain the management information provided in such solutions

279

Copyright 2014 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s). Editorial review has
deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.