Online Task 1: Transportation Model Programming

Problem 1: Wheat is harvested in the Midwest and stored in grain elevators in three different cities—
Kansas City, Omaha, and Des Moines. These grain elevators sup- ply three flour mills, located in Chicago,
St. Louis, and Cincinnati. Grain is shipped to the mills in railroad cars, each car capable of holding one ton
of wheat. Each grain elevator is able to supply the following number of tons (i.e., railroad cars) of wheat
to the mills on a monthly basis.

Grain Elevator Supply

1. Kansas City 150
2. Omaha 175
3. Des Moines 275
Total 600 tons

Each mill demands the following number of tons of wheat per month.

Mill Demand
A. Chicago 200
B. San Antonio 100
C. Indiana 300
Total 600 tons

The cost of transporting one ton of wheat from each grain elevator (source) to each mill
(destination) differs according to the distance and rail system. These costs are shown in the ff table (cost
is in $)

Mill
Grain Elevator A. Chicago B. San Antonio C. Indiana
1. Kansas City 6 8 10
2. Omaha 7 11 11
3. Des Moines 4 5 12

Find the following:

1. Initial Feasible Solution using

a. Northwest Corner Rule
b. Greedy Method/Minimum Cost Method
c. Vogel’s Approximation Method
2. Optimal solution using
a. MODI
Problem 2: After some special presentations, the employees of the AV Center have to move overhead
projectors back to classrooms. The table below indicates the buildings where the projectors are now (the
sources), where they need to go (the destinations), and a measure of the distance between sites.

Destination
Source Business Education Parsons Hall Holmstedt Hall Supply
Baker Hall 10 9 5 2 35
Tirey Hall 12 11 1 6 10
Arena 15 14 7 6 20
Demand 12 20 10 10

Find the following

1. Initial Feasible solution using any of the three methods
2. Optimal solution using stepping stone or MODI