Exam 4 - ISE 2404 – DOR (11) Name:
Section:
1
Directions: You may only use the two pages of (paper) notes that you prepared for
reference. You may not use computers or calculators or class-mates. Please write your
answers on the test sheet if possible. You have 45 minutes to complete this exam. Good
luck and clear thinking.
Problem 1 (10): Dijkstra has forgotten his algorithm! Please help him and demonstrate the
algorithm on the following network. We want the shortest path from node a to node g. Preserve
all node labels, put newer labels to the right of earlier labels and indicate a permanent label by
underlining it (see the example node below). Remember to indicate the selected arcs.
∞, 12,7, 5 (node labeling example)
What is the length of the shortest path from a to g?
Problem 2 (20): SoulSolution has two factories that produce shoes. In November the demand is
for 160 pairs of shoes, and in December it is for 260 pairs. Factory 1 has 240 worker-hours in
November, and 160 in December, while Factory 2 has 280 worker-hours in November and 180 in
December. It takes 2 worker-hours to produce a pair of shoes. Shoes built in November can be
used to satisfy demand in December, subject to a $7 per pair holding cost. Workers are paid $17
an hour, but not all worker-hours must be used. It costs $2 to ship a pair of shoes from Factory 1
and $3 to ship from Factory 2. Graphically formulate a balanced Transportation Problem that
can be used satisfy demand while minimizing costs.
3
4
4 3
4
1
3
5
a
b
c
d
f
e
g
2 6
