Dated: 7th April 2021 Due Date: 15th April 2021 (In class) Home Work #8 TRANSPORTATION ALGORITHM (30 points, 10 points each) Solve the transportation problem for each of the following models. The number in the cell is the cost, the number left of each row is the supply and the number below each column is the demand. 1 25 20 1 423 5 5 10 9 6 5 102 4 2 4 | 3 1 02. 7 6 6 8 5 6 Using the initial feasible solution from HW#7, find the optimal solution using the transportation algorithm. Show all the steps. NETWORK ALGORITHMS (10 points) Production Planning. DirectCo sells an item whose demands over the next 4 months are 100, 140, 210, and 180 units, respectively. The company can stock just enough supply to meet each month's demand, or it can overstock to meet the demand for two or more consecutive months. In the latter case, a holding cost of $1.20 is charged per overstocked unit per month. DirectCo estimates the unit purchase prices for the next 4 months to be $15, $12, $10, and $14, respectively. A setup cost of $200 is incurred each time a purchase order is placed. The company wants to develop a purchasing plan that will minimize the total costs of ordering, purchasing, and holding the item in stock. Formulate the problem as a shortest-route model