1. Question 22. (30 points)

The Shamrock Transportation Company has four terminals: A, B, C, and D. At the start of a particular day, there are 8, 8, 6, and 3 tractors available at those terminals, respectively. During the previous night, trailers were loaded at plants R, S, T, and U. The number of trailers at each plant is 2, 12, 5, and 6, respectively. The company dispatcher has determined the distances between each terminal and each plant, as follows.

Please:

1. Use Greedy method to help the company figure out an acceptable solution.
2. Assuming u₁=0, calculate u_i and v_j (Please notice that you must set u₁=0, otherwise the answer will be considered wrong and receives 0 points).
3. Based on u_i and v_j, calculate w_ij for unused routes (squares).
4. Based on w_ij, is the current solution (figured out by Greedy method) the optimal solution? Why?

SOLUTION FORMAT;

Question 4.) Based on wij, is the current solution (figured out by Greedy method) the optimal solution? Why?

Question 3.)
Calculate wij
wij	Dest 1	Dest 2	Dest 3	Dest 4	Ui
Origin 1
Origin 2
Origin 3
Origin 4
Vj

Question 1.) and 2.)
Decision Variables		Greedy Method
Shipments	Dest 1	Dest 2	Dest 3	Dest 4	Ui
Origin 1					0
Origin 2
Origin 3
Origin 4
Vj