D,1 9.3-6. Starting with Vogel's approximation method, interac- tively apply the transportation simplex method to solve the Job Shop Co. assignment problem as formulated in Table 9.26b. (As stated in Sec. 9.3, the resulting optimal solution has x14 = 1, X23 = 1, X31 = 1, x42 = 1, and all other Xij = 0.) TABLE 9.26 Parameter table for the assignment problem formulated as a transportation problem, illustrated by the Job Shop Co. example (a) General Case (b) Job Shop Co. Example Cost per Unit Cost per Unit Distributed Distributed Destination Destination (Location) 1 Supply 1 2 4 Supply 1 13 16 Source C2 Source 15 M 20 (Mochine) 7 6 Col C 1 4D) 0 0 0 1 n 012 11 1 2 1 1 1 C21 2 3 NMOO 1 1 1 5 C Demand 1 1 1 Demand 1 1 1 1