QUANTITATIVE METHODS FOR MANAGEMENT

1st Qtr SY 2019-2020

QUIZ #2
TRANSPORTATION MODELS / NETWORK MODELS

Problem Solving. Present clean and clear solutions to the following problems. Highlight the final answer by enclosing it
within a box.

Part 1.

1. Determine the basic feasible solution of the following transportation model using the three algorithms.

2. Determine the optimal solution for the transportation problem in No. 4. Use both methods.

3. Cars are shipped from three distribution centers to five dealers. The shipping cost is based on the mileage between
the sources and the destinations and is independent of whether the truck makes the trip with partial or full loads.
The following table summarizes the mileage between the distribution centers and the dealers together with the
monthly supply and demand figures given in number of cars. A full truckload includes 18 cars. The transportation
cost per truck mile is $25. Determine the optimal shipping schedule.

1 2 3 4 5 Supply
1 100 150 200 140 35 400
2 50 70 60 65 80 200
3 40 90 100 150 130 150
Demand 100 200 150 160 140

4. JoShop needs to assign 4 jobs to 4 workers. The cost of performing a job is a function of the skills of the workers.
The following table summarizes the cost of the assignments. Worker 1 cannot do job 3, and worker 3 cannot do job
4. Determine the optimal assignment using the Hungarian method.

Mapua University Page 1 of 3

School of Chemical, Biological and Materials Engineering and Sciences
 QUANTITATIVE METHODS FOR MANAGEMENT
1st Qtr SY 2019-2020

Part 2.

5. In intermodal transportation, loaded truck trailers are shipped between railroad terminals by placing the trailer on
special flatbed carts. The following table shows the existing railroad tracks. The objective is to decide which tracks
should be “revitalized” to handle the intermodal traffic. In particular, the Los Angeles (LA) terminal must be linked
directly to Chicago (CH) to accommodate expected heavy traffic. Other than that, all the remaining terminals can be
linked, directly or indirectly, such that the total length (in miles) of the selected tracks is minimized. Determine the
segments of the railroad tracks that must be included in the revitalization program.

6. IQ Smart drives daily to work. Having just completed a course on network analysis, Smart is able to determine the
shortest route to work. Unfortunately, the selected route is heavily patrolled by police, and with all the fines paid
for speeding, the shortest route may not be the best choice. Smart has thus decided to choose a route that
maximizes the probability of not being stopped by police. The network on the following slide shows the possible
routes between home and work and the associated probabilities of not being stopped on each segment. The
probability of not being stopped on the way to work is the product of the probabilities associated with the
successive segments of the selected route. Determine his daily route.

Mapua University Page 2 of 3

School of Chemical, Biological and Materials Engineering and Sciences
 QUANTITATIVE METHODS FOR MANAGEMENT
1st Qtr SY 2019-2020

7. Determine the maximal flow in the following network.

4 2
0 0
5

0
1 5
0
0
1 3
0
0
2
0
1
3 0 2
0 3
0 0
0 2 0
4
0

8. The activities involved in a candlelight choir service are listed here. Construct the project network

9. Determine the critical path and prepare the project schedule for the problem in #8.

Mapua University Page 3 of 3

School of Chemical, Biological and Materials Engineering and Sciences