1. Compute the starting feasible solution using the Northwest Method. (5 pts.) 2. 3. Compute the entering variable. (8 pts.) Compute the " leaving variable. (7pts.) 4. Compute the new table. (7pts.) 5. 6. 7. Compute the entering variable. (7 pts.) Compute the leaving wariable (7pts.) Compute the new table (7 pts.) 8. 9. Determine if your solution is optimal. (7 pts.) Determine the final answer. (5 pts.) I. Transportation Problem: Formulation (40 pts.) ChipsCo has five plants P1, P2, P3, P4 & P5 and five distribution centers in D1, D2, D3, D4, D5. The capacities of the five plants are 225, 175, 132, 118, & 100, respectively. The demands at the five distribution centers for the same period are 125, 175, 145, 105, & 150, respectively The following table represents the distance in Kilometers between the plants and the distribution centers: D2 110 DS 57 22 PI P2 P3 P4 PS DI 112 70 61 83 92 13 24 44 107 D3 45 36 47 27 S3 D4 32 17 109 101 29 12 31 The truck company will charge General Paint 52 per kilometer. 1. Define the decisional variables. (8 pts.) 2. Construct the transportation table including 4. Transportations Costs (8 pts.) b. Supply values. (8 pts.) c. Demand Values. (8 pts.) d. Balance the Model. (8pts) II. Transportation Problem: Algorithm (60 pts.) The following table summarizes the cost matrix of Logistics Co, transportation model: Texas California Florida New York Los Angeles Supply SS SI2 $19 S20 12 Detroit 59 S6 SIS S16 13 Michigan S3 59 SIS $21 25 Arizona S2 SIO S12 17 Washington S12 SIS SIO $10 13 Demand 20 20 15 25 $13 1. Compute the starting feasible solution using the Northwest Method. (5 pts.) 2. 3. Compute the entering variable. (8 pts.) Compute the I" leaving variable. (7 pts.)