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. 1.) Use Northwestern Method to help the company figure out an acceptable solution. 2.) Assuming u1=0, calculate ui and vj (Please notice that you must set u1=0, otherwise the answer will be considered wrong and receives 0 points). 3.) Based on ui 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?

Please answer all 4 questions in mentioned forma in the excel with attached greedy method usage

Travelling Distance Matrix Question 3.) Question 1.) and 2.) Decision Variables Greedy Method Question 4.)Based on wij, is the current solution (figured out by Greedy method) the optimal solution? Why