Professional Documents
Culture Documents
SPRING 2007-08
Management Science
by
Asst. Prof. Sami Fethi
2007 Pearson Education
1
Chapter Topics
Operations Research
Overview
Part of a larger class of linear programming problems
known as network flow models.
Possess special mathematical features that enabled
development of very efficient, unique solution methods.
Methods are variations of traditional simplex procedure.
Detailed description of methods is contained in CD-ROM
Module B, Transportation and Assignment Solution
Methods.
Text focuses on model formulation and solution with Excel
and QM for windows.
Operations Research
The Transportation
Model Characteristics
To use the transportation model we need to know the following:
The origin points and the capacity or supply per period at each
The destination points and the demand per period at each
The cost of shipping one unit from each origin to each
destination
The transportation problem can be regarded as a generalization of the
assignment problem. In an assignment problem we have a number of origins
each processing one item, and the same number of destinations each
requiring one item and are asked to empty the origins and fill the
destinations in such a way the Total Effectiveness is optimized. In a
transportation problem we have m origins, with origin i processing ai
items and n destinations (possibly different number from m) with
destination j requiring bj items, and with
ai = bj.
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
Operations Research
End of chapter
Operations Research